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

1 Answer

0 votes
using System;

class Program
{
    // Function to check if a number is a palindrome
    static bool IsPalindrome(int num) {
        int temp = num, rev = 0;

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

        return rev == num;
    }

    // Function to get the largest palindrome from the product of two 2-digit numbers
    static int GetLargestPalindromeOfTwo2DigitNumbers() {
        int largestPalindrome = 0;

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

        return largestPalindrome;
    }

    static void Main()
    {
        Console.WriteLine($"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

*/

 



answered May 11, 2025 by avibootz
...