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

1 Answer

0 votes
package main

import (
    "fmt"
)

// Function to check if a number is a palindrome
func isPalindrome(num int) bool {
    temp := num
    rev := 0

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

    return rev == num
}

// Function to find the largest palindrome from the product of two 2-digit numbers
func getLargestPalindromeOfTwo2DigitNumbers() int {
    largestPalindrome := 0

    for i := 10; i < 100; i++ {
        for j := 10; j < 100; j++ {
            product := i * j
            if isPalindrome(product) && product > largestPalindrome {
                largestPalindrome = product
            }
        }
    }

    return largestPalindrome
}

func main() {
    fmt.Printf("The largest palindrome made from the product of two 2-digit numbers is: %d\n", getLargestPalindromeOfTwo2DigitNumbers())
}



 
/*
run:

The largest palindrome made from the product of two 2-digit numbers is: 9009

*/

 



answered May 11, 2025 by avibootz
...