Advent of Code 2024 Solutions
| Day | Part 1 | Part 2 |
|---|---|---|
| 1 | Sort + Iterate | Sort + Iterate and count |
| 2 | Iterate and test | Brute force all possibilities |
| 3 | Manual regex | More manual regex |
| 4 | Iterate and brute force | Iterate and brute force |
| 5 | Direct Simulation | Direct Simulation |
| 6 | Brute force | Iterate and brute force |
| 7 | Recursion | Recursion with 1 more case |
| 8 | Iterate and brute force | Iterate and brute force |
| 9 | Brute force moving files back | Same brute force with full chunks |
| 10 | Descend in order of heights with a set | Descend in order of heights with counts |
| 11 | Brute force recursion | Recursion with memoization |
| 12 | Flood fill and counting | Flood fill creating perimeter with unique coordinates |
| 13 | Solving the system | Solving the system |
| 14 | Addition with mod | Iteration for consecutive robots |
| 15 | Direct simulation | Direct simulation with recursion |
| 16 | Dijkstra | Dijkstra followed by BFS |
| 17 | Direct simulation | Recursive backtracking |
| 18 | BFS | Binary Search with BFS |
| 19 | Dynamic Programming | Dynamic Programming |
| 20 | Maze simulation | Brute force |
| 21 | DFS + BFS | DFS + BFS |
| 22 | Direct simulation | Direct simulation with sets |
| 23 | Brute force | Networkx Cheese |
| 24 | Toposort on a stack | Paper + Pencil |
| 25 | Test all pairs | GG |