Expand description
Solutions for Advent of Code 2018
Macros§
- puzzles
- Macro which supplies a list of implemented puzzle solutions in this crate.
Structs§
- Day01
- 2018 Day 1: Finding the first repeat.
- Day02
- 2018 Day 2: Finding near-match IDs.
- Day03
- 2018 Day 3: Identifying the region that isn’t overlapped.
- Day04
- 2018 Day 4: Analysing guard sleep schedules.
- Day05
- 2018 Day 5: Reducing the input by removing matching letter pairs.
- Day06
- 2018 Day 6: Measuring regions using Manhattan distance.
- Day07
- 2018 Day 7: Scheduling steps with dependencies.
- Day08
- 2018 Day 8: Summing nested node metadata.
- Day09
- 2018 Day 9: Simulating a marble game.
- Day10
- 2018 Day 10: Recognizing text formed by converging points.
- Day11
- 2018 Day 11: Locating the optimal square subregion.
- Day12
- 2018 Day 12: Simulating 1D cellular automata.
- Day13
- 2018 Day 13: Simulating mine carts on intersecting tracks.
- Day14
- 2018 Day 14: Searching for a pattern in an infinite recipe list.
- Day15
- 2018 Day 15: Simulating battle outcomes between elves and goblins.
- Day16
- 2018 Day 16: Inferring opcode operations from examples.
- Day17
- 2018 Day 17: Simulating water flow in a 2D grid.
- Day18
- 2018 Day 18: Simulating a cyclic forest cellular automaton.
- Day19
- 2018 Day 19: Interpreting assembly to calculate the sum of divisors.
- Day20
- 2018 Day 20: Following a regex’s branching paths within a grid.
- Day21
- 2018 Day 21: Interpreting assembly to find the longest running input.
- Day22
- 2018 Day 22: Searching a cave with different tools.
- Day23
- 2018 Day 23: Finding the point in range of the most nodes.
- Day24
- 2018 Day 24: Simulating fight outcomes between a reindeer’s immune system and an infection.
- Day25
- 2018 Day 25: Clustering points within Manhattan distance.