# Euler Problem 4: Largest palindrome product : C Programming Solution

**Problem 4: **

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.

**Solution Approach:**

Brute force method:

- Create a function that checks a number for being a palindrome.
- keep multiplying the numbers from 999 X 999 decretmenting one at a time.
- Find the multiplication and get the highest product and print