/**
 * A palindromic number reads the same both ways.
 * The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
 *
 * Find the largest palindrome made from the product of two 3-digit numbers.
 *
 * @author David Clutter
 */
public class Problem0004 {

    public static void main(final String[] args) {
        long largestPalindrome = 0;
        for(int i = 100; i < 1000; ++i) {
            for(int j = 100; j < 1000; ++j) {
                final long product = i * j;
                if(Utilities.isPalindrome(product) && product > largestPalindrome) {
                    largestPalindrome = product;
                }
            }
        }
        System.out.println(largestPalindrome);
    }
}
@@ -1,8 +1,45 @@
+import java.util.stream.LongStream;%0A%0A
 /**%0A * A
@@ -172,24 +172,28 @@
  91 %C3%97 99.%0A *
+ %3Cp%3E
 %0A * Find the
@@ -369,24 +369,25 @@
 args) %7B%0A
+%0A
         
 long lar
@@ -378,16 +378,22 @@
         
+final 
 long lar
@@ -413,98 +413,119 @@
 e = 
-0;%0A        for(int i = 100; i %3C 1000; ++i) %7B%0A            for(int j = 100; j %3C
+LongStream.range(100, 1_000)%0A                .flatMap(i -%3E%0A                        LongStream.range(100,
  1
+_
 000
-; ++j) %7B
+)
 %0A   
@@ -541,169 +541,90 @@
     
-final long product = i * j;%0A                if(Utilities.isPalindrome(product) && product %3E largestPalindrome) %7B%0A                    largestPalindrome = product;
+                .map(j -%3E i * j))%0A                .filter(Utilities::isPalindrome)
 %0A   
@@ -628,33 +628,38 @@
                 
-%7D
+.max()
 %0A            %7D%0A 
@@ -658,20 +658,26 @@
     
- %7D%0A
      
-   %7D
+.getAsLong();
 %0A   

Update problem0004 to use streams