Euler Problem 4 solution

Time (s): ~0.018

package margusmartseppcode.From_1_to_9;

public class Problem_4 {
 static boolean isPalindrome(String p) {
  return p.equals(new StringBuilder(p).reverse().toString());
 }

 public static void main(String[] args) {
  int limit = 999, max = 0;

  for (int i = limit; i > 101; i -= 2)
   for (int j = i; j > 101 && i * j > max; j -= 2)
    if (isPalindrome("" + (i * j)))
     max = i * j;

  System.out.println(max);
 }
}