@@ -0,0 +1,1145 @@
+/**%0A * http://projecteuler.net/problem=4%0A * Created by bas on 1/28/15.%0A * A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 %C3%97 99.%0A * %3Cp/%3E%0A * Find the largest palindrome made from the product of two 3-digit numbers.%0A */%0Apublic class Problem4 %7B%0A    public static void main(String%5B%5D args) %7B%0A        int palindrome = ThreeDigitScan();%0A        if (palindrome %3C 0) %7B%0A            System.out.println(%22No palindrome found.%22);%0A        %7D else %7B%0A            System.out.println(ThreeDigitScan());%0A        %7D%0A    %7D%0A%0A    private static int ThreeDigitScan() %7B%0A        int minnumber = 100; // Smallest 3 digit numbers%0A        for (int a = 999; a %3E= minnumber; a--) %7B%0A            for (int b = 999; b %3E= minnumber; b--) %7B%0A                int product = a * b;%0A                if (IsPalindrome(product)) %7B%0A                    return product;%0A                %7D%0A            %7D%0A        %7D%0A        return -1;%0A    %7D%0A%0A    private static boolean IsPalindrome(int number) %7B%0A        String str = String.valueOf(number);%0A        return new StringBuilder(str).reverse().toString().equals(str);%0A    %7D%0A%7D%0A

Add Problem 4, incomplete