// Function to check if a number is a palindrome
function isPalindrome(num: number): boolean {
let temp: number = num;
let rev: number = 0;
while (temp > 0) {
rev = rev * 10 + (temp % 10);
temp = Math.floor(temp / 10);
}
return rev === num;
}
// Function to find the largest palindrome from the product of two 2-digit numbers
function getLargestPalindromeOfTwo2DigitNumbers(): number {
let largestPalindrome: number = 0;
for (let i: number = 10; i < 100; i++) {
for (let j: number = 10; j < 100; j++) {
let product = i * j;
if (isPalindrome(product) && product > largestPalindrome) {
largestPalindrome = product;
}
}
}
return largestPalindrome;
}
console.log("The largest palindrome made from the product of two 2-digit numbers is: " + getLargestPalindromeOfTwo2DigitNumbers());
/*
run:
"The largest palindrome made from the product of two 2-digit numbers is: 9009"
*/
