🚨
Spoiler alert: This post contains spoilers for Project Euler.
Problem 4
Largest palindrome made from the product of two 3-digit numbers
JS Solution 1 (Brute force)
This one is pretty simple with a brute force. We could search through every combination of numbers from 100-999, but realistically the answer will probably be in the 900's. So searching from 900-999 saves us a bit of time.