@@ -0,0 +1,1171 @@
+%0Aimport javax.swing.JOptionPane;%0A%0A/**%0A * Find the largest palindrome made from the product of two 3-digit numbers.A%0A * palindromic number reads the same both ways. The largest palindrome made from%0A * the product of two 2-digit numbers is 9009 = 91 %C3%97 99.%0A *%0A * @author Matthew Van der Bijl%0A */%0Apublic final class Problem_4 implements Runnable %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        new Problem_4().run();%0A    %7D%0A%0A    @Override%0A    public void run() %7B%0A        int largest = 0;%0A%0A        for (int i = 100; i %3C 1000; i++) %7B%0A            for (int j = 100; j %3C 1000; j++) %7B%0A                int num = i * j;%0A                if (isPalindrome(num) && num %3E largest) %7B%0A                    largest = num;%0A                %7D%0A            %7D%0A        %7D%0A%0A//        System.out.println(largest);%0A        JOptionPane.showMessageDialog(null, largest);%0A    %7D%0A%0A    private boolean isPalindrome(int number) %7B%0A        return (number + %22%22).equals(this.reverse(number + %22%22));%0A    %7D%0A%0A    private String reverse(String str) %7B%0A        String output = %22%22;%0A        for (int i = str.length() - 1; i != -1; i--) %7B%0A            output += str.charAt(i);%0A        %7D%0A        return output;%0A    %7D%0A%7D%0A

Create Problem_4.java