Question

How to find the largest palindrome made from the product of two 2-digit numbers in Kotlin

Answer 1

fun isPalindrome(num: Int): Boolean {
    var temp = num
    var rev = 0

    while (temp > 0) {
        rev = rev * 10 + (temp % 10)
        temp /= 10
    }

    return rev == num
}

fun getLargestPalindromeOfTwo2DigitNumbers(): Int {
    var largestPalindrome = 0

    for (i in 10..99) {
        for (j in 10..99) {
            val product = i * j
            if (isPalindrome(product) && product > largestPalindrome) {
                largestPalindrome = product
            }
        }
    }

    return largestPalindrome
}

fun main() {
    println("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
  
*/

 

70+ SQL courses for beginners and professionals