using System;

/*

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

​

Find the largest palindrome made from the product of two 3-digit numbers.

*/

public class Program

{

    public static void Main()

    {

        int i = 999;

        int j = i;

        int p = i*j;

        int final = 0;

        while (j > 100 || i > 100)

        {

            if(checkPalindrome(p) && final < p){

                Console.WriteLine("new final");

                final = p;

            }

            if(j > 100)

            {

                j--;

            } else if(i>100) {

                i--;

                j = i;

            } else {

                break;

            }

            p = i*j;

        }

        //Console.WriteLine("Checking " + val + ": " + iterateUntilPalindrome(val.ToString()));

        Console.WriteLine("i:"+i+" j:"+j+" largest:"+final);

    }

​

    public static bool checkPalindrome(int n)

    {

        char[] p = n.ToString().ToCharArray();

        int e = p.Length - 1;

        int s = 0;

        while (e > s)

        {

            if (p[e] != p[s])

            {

                return false;

            }

​

            e--;

            s++;

        }

​

        return true;

    }

​

​

}