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

largest-palindrome.js

function getPalindrome() {
    var product, y,
        x = 999,
        largest = 0;

    while (x > 99) {
        y = x;
        while (y > 99) {
            product = x * y;
            if (product <= largest) break;
            if (product.toString() === product.toString().split("").reverse().join(""))
                largest = product;
            y--;
        }
        x--;
    }

    return largest;
}

console.log(getPalindrome());