This year's solution for AoC done in Python
- day 7: Segment Tree
- day 10: Naive implementation
- day 11: Possibly graphs
- day 12: Graphs, find the size of the component (or find the cardinality of the component)
- day 13: Naive implementation; possibly mathematics based on picosecondth, depth, range (we always know where the scanner will be at a certain moment)
- day 15: Naive implementationзация