Question

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

Answer 1

import Foundation

func isPalindrome(_ num: Int) -> Bool {
    var temp = num
    var rev = 0

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

    return rev == num
}

func getLargestPalindromeOfTwo2DigitNumbers() -> Int {
    var largestPalindrome = 0

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

    return largestPalindrome
}

print("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