Cafeteria

Advent of Code 2025 Day 5 Part 1 Working from brute-force to anything better A brute-force algorithm would work as follows: Set counter to 0 For each ID While true Check the next range for inclusion of the current ID If ID is included Increment counter Break out of this loop My puzzle input includes 1000 ingredient IDs and almost 200 ranges. That's as many as 200k operations...assuming each iteration checked every range. It's not many - it would probably finish in miliseconds. But there must be