Advent of Code 2020 - Day 7

in   code   ,

Day 7 of AoC 2020 (Handy Haversacks) is when the problems get a little bit harder to solve. However, it is a good example to use a directed acyclic graph (DAG) to visualize and solve the problem. Spoilers ahead.

Read more →

Advent of Code 2020 - Day 6

in   code   ,

Day 6 of AoC 2020 (Custom Customs) is a very easy problem to solve using Python sets. Today’s solution is an exercise in code golf. As always, spoilers ahead.

Read more →

Advent of Code 2020 - Day 5

in   code   ,

Day 5 of AoC 2020 (Binary Boarding) is a bit of a trick problem. However, once you understand the pattern inherent in the problem description, this is extremely straightforward. As always, spoilers ahead.

Read more →

Advent of Code 2020 - Day 4

in   code   ,

Day 4 of AoC 2020 (Passport Processing) is a fairly straightforward parsing problem. As with the previous posts in this series, we’ll use Python for the task. Spoilers lurk ahead.

Read more →