The objective here was to find the largest palindrome produced by
multiplying two three-digit numbers together. First was finding if
something was a palindrome, which is done relatively efficiently. Next,
you work from the largest products down to find the largest palindrome.
This is kinda simple. Just brute force it. It's math. Not really fun.