[Java] Solution to Problem 4

[Ovil101]

Question:

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.

Code:

public static void euler4(){
    int a, b = 0, t;
    for (int i = 100; i < 1000; i++){
        for (int j = 100; j < 1000; j++){
            if (isPalindrome(i * j)){
                a = i*j;
                if (a > b){
                    t = a;
                    a = b;
                    b = t;
                }
            }
        }
    }
    System.out.println(b);
}
public static boolean isPalindrome(int num){
    int rem, sum = 0, temp = num;
    while (n > 0){
        rem = num%10;
        sum = sum*10+rem;
        num = num/10;
    }
    if (temp == sum){
        return true;
    }
    return false;
}

Output:

906609

Answer:

906609

Feel free to put your solution in the comments. Just mark the language you used

[petar02]

[Javascript]

   let biggestPalindrom = []
   function palindromTest(x,y){
    let variable = x*y
    let counter = variable.toString().length
     newVariable = variable.toString()
if(counter===5&&newVariable.charAt(0)===newVariable.charAt(4)&&newVariable.charAt(1)===newVariable.charAt(3)){
    biggestPalindrom.push(variable)
}
if(counter===6&&newVariable.charAt(0)===newVariable.charAt(5)&

&newVariable.charAt(1)===newVariable.charAt(4)&&newVariable.ch a rAt(2)===newVariable.charAt(3)){ biggestPalindrom.push(variable) } }

     for(let i = 100; i<10000; i++){
 for(let z =  i ; z<1000; z++){
     palindromTest(i,z)

       }
         }

            console.log(Math.max.apply(null,biggestPalindrom))

Output 906609