My times: 00:02:38 / 00:03:57
Problem: https://adventofcode.com/2025/day/2
Solution: https://github.com/jonathanpaulson/AdventOfCode/blob/master/2025/2.py
Brute force again. Just try all possible numbers. In part 1, we try splitting each number in half, and in part 2 we try all factors of the number's length (and, in keeping with the brute force theme, compute those factors in the simplest way possible). This actually takes a few seconds for part 2, but that's tolerable.
