[Advent of Code 2021] Day 16 | Packet Decoder
Day 16 - Complicated packet parsing (no actual networking) for arithmetic operations. Using a stack to keep track of nested operations π§…
Day 16 - Complicated packet parsing (no actual networking) for arithmetic operations. Using a stack to keep track of nested operations π§…
Day 15 - Dijkstra's algorithm!! Might be the easiest solution to implement that is not >O(V^2) πΊοΈ…
Day 14 - Exponential growth of a polymer does not scale well, and it turns out that the same type of solution for lanternfish (day 6) works here π§ͺ…
Day 13 - Origami required calculating the mirror coordinates across the folds π¦’…
Day 12 - Finding all paths for a bidirectional graph with some special rules as to what nodes can be visited how many number of times. TSP sub-problem? π’…