Find the largest palindrome made from the product of two 3-digit numbers - Javascript

Question

Can anyone tell me what\'s wrong with the code. Find the largest palindrome made from the product of two 3-digit numbers.

function largestPalind         


        

Answer 1

This is how I did it in Javascript. Simple & easy!

let num1 = 999;
let num2 = 999;
let arr = [];

function check(x, y)
{
    if(String(x*y) == String(x*y).split("").reverse().join(""))
    {
        return true;
    }
return false;
}

for(let i=0; i<999999; i++)
{
    if(check(num1, num2))
    {
        arr.push(num1*num2);
        num1--;
        num2 = num1+1;
    }
num2--;
}

console.log(arr.sort((x, y) => y-x)[0]);