Our result for the largest palindrome that is the product of two 3-digit
numbers is correct.

The nested for-loop is O(n^2), so our implementation is only feasible
for small n... what are some algorithmic optimizations we could do to
make our solution more efficient?