Please be welcomed to my solutions for Advent of Code!!!
This year I'll attempt to solve all the puzzles of Advent of Code in Go, with no time constraints.
| Puzzle | Language | Completed | Specials |
|---|---|---|---|
| Day 1 | Go | 🌟🌟 | Modulo fun |
| Day 2 | Go | 🌟🌟 | |
| Day 3 | Go | 🌟🌟 | Recursion |
| Day 4 | Go | 🌟🌟 | Grid coordinates |
| Day 5 | Go | 🌟🌟 | Optimisation |
| Day 6 | Go | 🌟🌟 | String array manipulation |
| Day 7 | Go | 🌟 | |
| Day 8 | Go |
Aside from TryHackMe's Advent of Cyber, this year I'll try to solve all the puzzles of Advent of Code too, with no time constraints.
| Puzzle | Language | Completed | Specials |
|---|---|---|---|
| Day 1 | Go | ✔️ | Array manipulation |
| Day 2 | Go | ||
| Day 3 | Go | ||
| Day 4 | Go | ||
| Day 5 | Go |
Repository: advent_of_code_2023
In 2023 I also completed TryHackMe's Advent of Cyber.
| Puzzle | Language | Completed | Specials |
|---|---|---|---|
| Day 1 | Python | ||
| Day 2 | Python | ||
| Day 3 | Python | ||
| Day 4 | Python | ||
| Day 5 | Python |
Repository: advent_of_code_2022
| Puzzle | Language | Completed | Target met on time | Specials |
|---|---|---|---|---|
| Day 1 | Python | ✔️ | 🌟🌟 | |
| Day 2 | Python | ✔️ | 🌟🌟 | Rock, Paper, Scissors! |
| Day 3 | Python | ✔️ | 🌟🌟 | Set intersection |
| Day 4 | Python | ✔️ | 🌟🌟 | Range overlap detection |
| Day 5 | Python | ✔️ | 🌟🌟 | Stack-based crate movement |
| Day 6 | Python | ✔️ | 🌟🌟 | Signal detection algorithm |
| Day 7 | Python | ✔️ | 🌟🌟 | Traverse dict via recursion x2 |
| Day 8 | Python | ✔️ | 🌟🌟 | 99x99 grid, Coordinates class |
| Day 9 | Python | 🥴 | ⭐ | Moving a rope over a grid |
| Day 10 | Python | ✔️ | 🌟🌟 | CRT image render, racing the beam |
| Day 11 | Python | ✔️ | 🌟🌟 | Monkey in the Middle simulation |
| Day 12 | Python | ✔️ | 🌟🌟 | Dijkstra's algorithm |
| Day 13 | Python | Recursive list tree parsing | ||
| Day 14 | Python |
Repository: advent_of_code_2021
In 2021, I tried to complete every day at least with my strongest suit (Python) within the day and save a record whether the target had been met. Then, attempt to complete them in Golang without a time constraint (ideally marked with a check if solved before the next Advent of Code).
| Puzzle | Language | Completed | Target met on time | Specials |
|---|---|---|---|---|
| Day 1 | Python | ✔️ | 🌟🌟 | |
| Go | ✔️ | ✔️ | ||
| Day 2 | Python | ✔️ | 🌟🌟 | |
| Go | ✔️ | ✔️ | ||
| Day 3 | Python | ✔️ | 🌟🌟 | |
| Go | ✔️ | ✔️ | ||
| Day 4 | Python | ✔️ | 🌟🌟 | |
| Go | ✔️ | ✔️ | Bingo! | |
| Day 5 | Python | 🥴 | ⭐ | |
| Go | ✔️ | ✔️ | 1,000 by 1,000 diagram | |
| Day 6 | Python | ✔️ | 🌟🌟 | |
| Go | ✔️ | ✔️ | Memory management | |
| Day 7 | Python | ✔️ | 🌟🌟 | |
| Go | ✔️ | ✔️ | ||
| Day 8 | Python | ✔️ | 🌟🌟 | |
| Go | ✔️ | ✔️ | Seven-segment displays | |
| Day 9 | Python | 🥴 | ⭐ | |
| Go | ✔️ | ✔️ | 100 by 1,000 Grid, breadth-first search | |
| Day 10 | Python | ✔️ | 🌟🌟 | |
| Go | ✔️ | ✔️ | Syntax checker | |
| Day 11 | Python | 🥴 | 🥴 | |
| Go | ✔️ | ✔️ | 10 by 10 Grid, diagonals | |
| Day 12 | Go | ✔️ | ✔️ | Breadth-first search |
| Day 13 | Go | ✔️ | ✔️ | Folding grids |
| Day 14 | Go | ✔️ | ✔️ | Memory management |
| Day 15 | Go | ✔️ | ✔️ | Dijkstra's algorithm (TODO: 37' runtime) |
| Day 16 | Go | ✔️ | ✔️ | Bitwise operations. TODO: clean up |
| Day 17 | Go | ✔️ | ✔️ | |
| Day 18 | Go | In Progress! - Input parsing + RegExp |