My solutions for Advent of Code 2022.
(TODO: add final picture of AoC calendar)
(TODO: write)
🚀 TLDR: an online event where a two-part programming puzzle is released each day from Dec 1st to the 25th.
Advent of Code is an online event created by Eric Wastl. In his words:
Advent of Code is an Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like. People use them as a speed contest, interview prep, company training, university coursework, practice problems, or to challenge each other.
Source: https://adventofcode.com/about
❗️ Important: This repo was created from the template advent_of_code-template, please refer to its documentation for more information.
My solutions for the puzzles are available in the folder 📁 my_solutions and are organized into subfolders for each day of the event.
Inside each subfolder, the following files can be found:
input_test.txt- contains input from tests given in the puzzle.input.txt- contains my personal input for the puzzle.main.py- Python code for solving the puzzle.README.md- contains a tldr of the puzzle.solutions.txt- contains the solutions to my inputs for the puzzle.
Python 3.10termcolormake(for runningMakefile)
$ make d=1$ make d=8 p=1$ make d=8 p=2$ make test d=12$ make test d=12 p=1| DAY | PUZZLE TITLE | PUZZLE SUMMARY |
|---|---|---|
| 📁 01 | Calorie Counting | 📃 Input: a list of calories (integers) grouped by elf. ⭐ Part One: find the most total calories an elf is carrying. ⭐ Part Two: find the sum of calories of the 3 elves that are carrying the most total calories. |
| 📁 02 | Rock Paper Scissors | 📃 Input: an encrypted strategy guide. ⭐ Part One: find the total score after following the strategy guide. ⭐ Part Two: find the total score after following the strategy guide, with a new interpretation of the guide. |
| 📁 03 | Rucksack Reorganization | 📃 Input: a list of all of the items currently in each rucksack (a list of strings). ⭐ Part One: find the sum of the priority of the common item type. ⭐ Part Two: find the sum of the priority of the badges (common item type for each group of 3 rucksacks). |
| 📁 04 | Camp Cleanup | 📃 Input: a list of the section assignments for each pair of elf (a list of range pairs). ⭐ Part One: find how many pairs in which one range fully contains the other. ⭐ Part Two: find how many pairs in which the ranges overlap. |
| 📁 05 | Supply Stacks | 📃 Input: a drawing of the starting stacks of crates and the rearrangement procedure (moves). ⭐ Part One: find what crate ends up on top of each stack after the rearrangement procedure completes. ⭐ Part Two: same as before, but with a different rearrangement procedure. |
| 📁 06 | Tuning Trouble | 📃 Input: a datastream buffer (a string of lowercase alphabetic characters). ⭐ Part One: find how many characters need to be processed before the first start-of-packet marker is detected. ⭐ Part Two: find how many characters need to be processed before the first start-of-message marker is detected. |
| 📁 07 | No Space Left On Device | 📃 Input: the resulting terminal output of browsing around the device's filesystem. ⭐ Part One: find the sum of all of the directories with a total size of at most 100000. ⭐ Part Two: find the smallest directory that, if deleted, would free up enough space on the filesystem to run the update. |
| 📁 08 | Treetop Tree House | 📃 Input: a map with the height of each tree (a grid of single digit integers). ⭐ Part One: find how many trees are visible from outside the grid. ⭐ Part Two: find the highest scenic score possible for any tree. |
| 📁 09 | Rope Bridge | 📃 Input: a list of moves. ⭐ Part One: simulate the series of motions to find how many positions the rope's tail visited at least once. ⭐ Part Two: same as before, but now the rope has ten knots. |
| 📁 10 | Cathode-Ray Tube | 📃 Input: a list of CPU instructions. ⭐ Part One: find the sum of the six signal strengths. ⭐ Part Two: find the eight capital letters that appear after rendering the image given by the program. |
| 📁 11 | Monkey in the Middle | 📃 Input: notes on the items each monkey currently has, how worried you are about those items, and how the monkey makes decisions based on your worry level. ⭐ Part One: count how many items the monkeys inspect over 20 rounds, then calculate the level of monkey business. ⭐ Part Two: same as before, but without reducing the worry levels after each inspection and for 10.000 rounds. |
| 📁 12 | Hill Climbing Algorithm | 📃 Input: a heightmap of the surrounding area. ⭐ Part One: find the fewest steps required to move from the current positions to the highest location. ⭐ Part Two: find the fewest steps required to move starting from any square with the lowest elevation to the highest location. |
| 📁 13 | Distress Signal | 📃 Input: the list of received packets. ⭐ Part One: find the sum of the indices of pairs of packets that are in the right order. ⭐ Part Two: organize all of the packets into the correct order to find the decoder key for the distress signal. |
| 📁 14 | Regolith Reservoir | 📃 Input: the scan of a two-dimensional vertical slice of the cave. ⭐ Part One: simulate the falling sand to find how many units of sand come to rest before sand starts flowing into the abyss below. ⭐ Part Two: simulate the falling sand until the source of the sand becomes blocked, then find how many units of sand come to rest. |
| 📁 15 | Beacon Exclusion Zone | 📃 Input: a list of sensor positions and closest beacons. ⭐ Part One: in the row where y=2000000, find how many positions cannot contain a beacon. ⭐ Part Two: find the only possible position for the distress beacon, then calculate its tuning frequency. |
| 📁 16 | Proboscidea Volcanium | 📃 Input: a report of each valve's flow rate if it were opened (in pressure per minute) and the tunnels that connect the valves. ⭐ Part One: find the most pressure you can release form the valves. ⭐ Part Two: with you and an elephant working together for 26 minutes, find the most pressure that could be released. |
| 📁 17 | Pyroclastic Flow | 📃 Input: a list of jets of hot gas. ⭐ Part One: find how many units tall will the tower of rocks be after 2022 rocks have stopped falling. ⭐ Part Two: find how tall will the tower be after 1000000000000 rocks have stopped. |
| 📁 18 | Boiling Boulders | 📃 Input: a quick scan of a droplet (a list of 3D coordinates). ⭐ Part One: find the surface area of the scanned lava droplet. ⭐ Part Two: find the exterior surface area of the scanned lava droplet. |
| 📁 19 | Not Enough Minerals | 📃 Input: a list of blueprints. ⭐ Part One: determine the quality level of each blueprint using the largest number of geodes it could produce in 24 minutes, then add up the quality level of all of the blueprints in your list. ⭐ Part Two: determine the largest number of geodes that could be opened using each of the first three blueprints, then multiply these numbers together. |
| 📁 20 | Grove Positioning System | 📃 Input: a file that contains the grove's coordinates (a list of integers). ⭐ Part One: mix your encrypted file exactly once, then find the sum of the three numbers that form the grove coordinates. ⭐ Part Two: apply the decryption key and mix your encrypted file ten times, then find the sum of the three numbers that form the grove coordinates. |
| 📁 21 | Monkey Math | 📃 Input: a list of monkey math. ⭐ Part One: find what number will the monkey named root yell. ⭐ Part Two: find what number do you yell to pass root's equality test. |
| 📁 22 | Monkey Map | 📃 Input: a map of the board (a 2D grid representation of a cube) and the path you must follow (an alphanumeric string). ⭐ Part One: follow the path given in the monkeys' notes to find the final password. ⭐ Part Two: fold the map into a cube, then follow the path given in the monkeys' notes to find the final password. |
| 📁 23 | Unstable Diffusion | 📃 Input: a scan of the grove. ⭐ Part One: simulate the Elves' process and find the smallest rectangle that contains the Elves after 10 rounds, then find how many empty ground tiles that rectangle contains. ⭐ Part Two: figure out where the Elves need to go, then find the number of the first round where no Elf moves. |
| 📁 24 | Blizzard Basin | 📃 Input: a map of the valley and the blizzards. ⭐ Part One: find the fewest number of minutes required to avoid the blizzards and reach the goal. ⭐ Part Two: find the fewest number of minutes required to reach the goal, go back to the start, then reach the goal again. |
| 📁 25 | Full of Hot Air | 📃 Input: a list of all of the fuel requirements. ⭐ Part One: find the SNAFU number needed to supply to Bob's console. |