Advent of Code Day 6 - Binary Search
This is a faster solution to part 2 - it runs in O(log(T)) time instead of O(T) time. Binary search is a very generally useful technique. Also, adding asserts to catch bugs / verify assumptions is extremely useful.
Previous video: • Advent of Code 2023 - Day 6
Final code: https://github.com/jonathanpaulson/Ad...