ChrisLeNeve

import java.math.BigInteger;
import java.util.ArrayList;
import java.util.List;

class Scratch {
    public static void main(String[] args) {
        System.out.println(solution());
    }

    private static int solution() {

ChrisLeNeve

class Scratch {
    public static void main(String[] args) {
        System.out.println(solution(10));
    }

    private static int solution(int max) {
        int sumOfSquares = 0, sum = 0;
        for (int i = 1; i <= max; i++) {
            sumOfSquares += (i * i);
            sum += i;

ChrisLeNeve

import java.util.TreeSet;

class Scratch {
    static StringBuilder sb = new StringBuilder();

    public static void main(String[] args) {
        int solution = findLargestPalindrome();
        System.out.println(solution);
    }

ChrisLeNeve

import java.util.HashMap;
import java.util.Map;

class Scratch {
    public static void main(String[] args) {
        long number = 600851475143L;
//        long number = 13195;
        long result = findLargestPrimeFactor(number);
        System.out.println(result);
    }

ChrisLeNeve

import java.util.Set;
import java.util.TreeSet;

class Scratch {
    public static void main(String[] args) {
        long sum = findSolution();
        System.out.println(sum);
    }

    private static long findSolution() {

ChrisLeNeve

import java.util.List;
import java.util.Set;
import java.util.TreeSet;

class Scratch {
    public static void main(String[] args) {
//        int max = 10; // 23
        int max = 1000; // 233168
        int sum = findMultiplesV2(max);
        System.out.println("Sum is: " + sum);