The video demonstrates solving Advent of Code 2025 Day 5 in F# by parsing ingredient ID ranges and efficiently merging overlapping intervals using a scan-line approach to count fresh ingredients without enumerating all IDs. It highlights the iterative problem-solving process, including initial attempts, debugging, and ultimately adopting a clean algorithmic solution with thorough testing.
In this video, the presenter tackles day five of Advent of Code 2025 using F#. The puzzle, titled “Cafeteria,” involves determining which ingredient IDs are fresh based on given ranges of fresh ingredient IDs and a list of available ingredient IDs. The ranges are inclusive and can overlap, meaning an ingredient ID is fresh if it falls within any of the given ranges. The initial approach is straightforward: parse the input, split the ranges and ingredient IDs, and check each ingredient ID against the ranges to filter out the fresh ones.
After successfully implementing the first part, the presenter moves on to part two, which requires counting all fresh ingredient IDs considering overlapping ranges. Due to the potentially large number ranges, enumerating all IDs is impractical. Instead, the presenter explores range algebra to merge overlapping ranges efficiently. They discuss different cases of range overlaps, including no overlap, partial overlap, and complete containment, and write helper functions to handle these scenarios. Testing is emphasized to ensure correctness in handling these cases.
The presenter then attempts to merge all ranges into non-overlapping ranges using a fold operation but encounters issues with duplicates and incomplete merging. To address this, they introduce a fixed-point calculation approach, repeatedly merging ranges until no further changes occur. However, this approach leads to complications and inefficiencies. Debugging reveals that the merging logic and iteration over ranges need refinement, as the nested loops and fold operations do not cover all necessary combinations for merging.
A breakthrough comes when the presenter adopts a scan-line approach, sorting the ranges and merging them sequentially from left to right. This method simplifies the merging process by comparing adjacent ranges and combining them if they overlap. This approach eliminates the need for fixed-point recursion and results in a clean set of non-overlapping ranges. The presenter verifies the solution with tests and confirms that counting the total number of fresh ingredient IDs by summing the lengths of these merged ranges yields the correct result.
In conclusion, the video showcases a thoughtful problem-solving process involving parsing, range algebra, and algorithmic refinement. The presenter highlights the importance of drawing out problems, testing thoroughly, and reconsidering initial approaches when faced with complexity. The scan-line technique emerges as an effective strategy for merging overlapping ranges, demonstrating practical insights into handling interval problems in functional programming. The video ends with the presenter expressing satisfaction with the solution and encouraging viewers to continue exploring Advent of Code challenges.