object LargestPalindrome {
// Function to check if a number is a palindrome
def isPalindrome(num: Int): Boolean = {
var temp = num
var rev = 0
while (temp > 0) {
rev = rev * 10 + (temp % 10)
temp /= 10
}
rev == num
}
// Function to find the largest palindrome from the product of two 2-digit numbers
def getLargestPalindromeOfTwo2DigitNumbers(): Int = {
var largestPalindrome = 0
for (i <- 10 to 99; j <- 10 to 99) {
val product = i * j
if (isPalindrome(product) && product > largestPalindrome) {
largestPalindrome = product
}
}
largestPalindrome
}
def main(args: Array[String]): Unit = {
println(s"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
*/
