Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/ng-galien/advent-of-code-23

Advent Of Code 2023
https://github.com/ng-galien/advent-of-code-23

java-21

Last synced: about 2 months ago
JSON representation

Advent Of Code 2023

Awesome Lists containing this project

README 

        
# My Advent of Code 2023



![example workflow](https://github.com/ng-galien/advent-of-code-23/actions/workflows/gradle.yml/badge.svg)



An iterative 🤣 approach to solving the Advent of Code 2023 puzzles. 



Each puzzle is also a good candidate for a Kata experimenting with new `Java 21` 🚀 features. 



Obviously, `Copilot` is ~~not~~ allowed to help for ~~figuring out~~ writing the solution and `ChatGPT-4` is ~~not~~ allowed to help writing the documentation 😇.



### Summary



[Advent of Code](https://adventofcode.com/) 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.



* **Language**: Java 21 with preview features enabled

* **Days Completed**: 9



* **Day 1**: [Trebuchet?!](#day-1-trebuchet)

  - [X] [Part 1](#part-1)

  - [X] [Part 2](#part-2)

* **Day 2**: [Cube Conundrum](#day-2-cube-conundrum)

  - [X] [Part 1](#part-1-1)

  - [X] [Part 2](#part-2-1)

* **Day 3**: [Gear Ratios](#day-3-gear-ratios)

  - [X] [Part 1](#part-1-2)

  - [X] [Part 2](#part-2-2)

* **Day 4**: [The Great Escape](#day-4-the-great-escape)

  - [X] [Part 1](#part-1-3)

  - [X] [Part 2](#part-2-3)

* **Day 5**: [If You Give A Seed A Fertilizer](#day-5-if-you-give-a-seed-a-fertilizer)

  - [X] [Part 1](#part-1-4)

  - [X] [Part 2](#part-2-4)

* **Day 6**: [Wait For It](#day-6-wait-for-it)

  - [X] [Part 1](#part-1-5)

  - [X] [Part 2](#part-2-5)

* **Day 7**: [Camel Cards](#day-7-camel-cards)

  - [X] [Part 1](#part-1-6)

  - [X] [Part 2](#part-2-6)

* **Day 8**: [Haunted Wasteland](#day-8-haunted-wasteland)

  - [X] [Part 1](#part-1-7)

  - [X] [Part 2](#part-2-7)

* **Day 9**: [Mirage Maintenance](#day-9-mirage-maintenance)

  - [X] [Part 1](#part-1-8)

  - [X] [Part 2](#part-2-8)



## Day 1: Trebuchet?!



### Part 1



Something is wrong with global snow production, and you've been selected to take a look. The Elves have even given you a map; on it, they've used stars to mark the top fifty locations that are likely to be having problems.



You've been doing this long enough to know that to restore snow operations, you need to check all fifty stars by December 25th.



Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!



You try to ask why they can't just use a weather machine ("not powerful enough") and where they're even sending you ("the sky") and why your map looks mostly blank ("you sure ask a lot of questions") and hang on did you just say the sky ("of course, where do you think snow comes from") when you realize that the Elves are already loading you into a trebuchet ("please hold still, we need to strap you in").



As they're making the final adjustments, they discover that their calibration document (your puzzle input) has been amended by a very young Elf who was apparently just excited to show off her art skills. Consequently, the Elves are having trouble reading the values on the document.



The newly-improved calibration document consists of lines of text; each line originally contained a specific calibration value that the Elves now need to recover. On each line, the calibration value can be found by combining the first digit and the last digit (in that order) to form a single two-digit number.



For example:



```text

1abc2

pqr3stu8vwx

a1b2c3d4e5f

treb7uchet

```

In this example, the calibration values of these four lines are `12`, `38`, `15`, and `77`. Adding these together produces `142`.



Consider your entire calibration document. What is the sum of all of the calibration values?



### Part 2



Your calculation isn't quite right. It looks like some of the digits are actually spelled out with letters: one, two, three, four, five, six, seven, eight, and nine also count as valid "digits".



Equipped with this new information, you now need to find the real first and last digit on each line. For example:



```text

two1nine

eightwothree

abcone2threexyz

xtwone3four

4nineeightseven2

zoneight234

7pqrstsixteen

```

In this example, the calibration values are `29`, `83`, `13`, `24`, `42`, `14`, and `76`. Adding these together produces `281`.



What is the sum of all of the calibration values?



> Solution: [here](./src/main/java/com/github/nggalien/advent/Day1.java)



## Day 2: Cube Conundrum



### Part 1



You're launched high into the atmosphere! The apex of your trajectory just barely reaches the surface of a large island floating in the sky. You gently land in a fluffy pile of leaves. It's quite cold, but you don't see much snow. An Elf runs over to greet you.



The Elf explains that you've arrived at Snow Island and apologizes for the lack of snow. He'll be happy to explain the situation, but it's a bit of a walk, so you have some time. They don't get many visitors up here; would you like to play a game in the meantime?



As you walk, the Elf shows you a small bag and some cubes which are either red, green, or blue. Each time you play this game, he will hide a secret number of cubes of each color in the bag, and your goal is to figure out information about the number of cubes.



To get information, once a bag has been loaded with cubes, the Elf will reach into the bag, grab a handful of random cubes, show them to you, and then put them back in the bag. He'll do this a few times per game.



You play several games and record the information from each game (your puzzle input). Each game is listed with its ID number (like the 11 in Game 11: ...) followed by a semicolon-separated list of subsets of cubes that were revealed from the bag (like 3 red, 5 green, 4 blue).



For example, the record of a few games might look like this:



Game 1: 3 blue, 4 red; 1 red, 2 green, 6 blue; 2 green

Game 2: 1 blue, 2 green; 3 green, 4 blue, 1 red; 1 green, 1 blue

Game 3: 8 green, 6 blue, 20 red; 5 blue, 4 red, 13 green; 5 green, 1 red

Game 4: 1 green, 3 red, 6 blue; 3 green, 6 red; 3 green, 15 blue, 14 red

Game 5: 6 red, 1 blue, 3 green; 2 blue, 1 red, 2 green

In game 1, three sets of cubes are revealed from the bag (and then put back again). The first set is 3 blue cubes and 4 red cubes; the second set is 1 red cube, 2 green cubes, and 6 blue cubes; the third set is only 2 green cubes.



The Elf would first like to know which games would have been possible if the bag contained only 12 red cubes, 13 green cubes, and 14 blue cubes?



In the example above, games 1, 2, and 5 would have been possible if the bag had been loaded with that configuration. 

However, game 3 would have been impossible because at one point the Elf showed you 20 red cubes at once; similarly, game 4 would also have been impossible because the Elf showed you 15 blue cubes at once. If you add up the IDs of the games that would have been possible, you get `8`.



Determine which games would have been possible if the bag had been loaded with only 12 red cubes, 13 green cubes, and 14 blue cubes. What is the sum of the IDs of those games?



### Part 2



The Elf says they've stopped producing snow because they aren't getting any water! He isn't sure why the water stopped; however, he can show you how to get to the water source to check it out for yourself. It's just up ahead!



As you continue your walk, the Elf poses a second question: in each game you played, what is the fewest number of cubes of each color that could have been in the bag to make the game possible?



Again consider the example games from earlier:



```text

Game 1: 3 blue, 4 red; 1 red, 2 green, 6 blue; 2 green

Game 2: 1 blue, 2 green; 3 green, 4 blue, 1 red; 1 green, 1 blue

Game 3: 8 green, 6 blue, 20 red; 5 blue, 4 red, 13 green; 5 green, 1 red

Game 4: 1 green, 3 red, 6 blue; 3 green, 6 red; 3 green, 15 blue, 14 red

Game 5: 6 red, 1 blue, 3 green; 2 blue, 1 red, 2 green

```



In game 1, the game could have been played with as few as 4 red, 2 green, and 6 blue cubes. If any color had even one fewer cube, the game would have been impossible.

Game 2 could have been played with a minimum of 1 red, 3 green, and 4 blue cubes.

Game 3 must have been played with at least 20 red, 13 green, and 6 blue cubes.

Game 4 required at least 14 red, 3 green, and 15 blue cubes.

Game 5 needed no fewer than 6 red, 3 green, and 2 blue cubes in the bag.

The power of a set of cubes is equal to the numbers of red, green, and blue cubes multiplied together. 

The power of the minimum set of cubes in game 1 is `48`. In games 2-5 it was `12`, `1560`, `630`, and `36`, respectively. Adding up these five powers produces the sum `2286`.



For each game, find the minimum set of cubes that must have been present. What is the sum of the power of these sets?

> [Documentation](./day2.md) | [Code](./src/main/java/com/github/nggalien/advent/Day2.java)



## Day 3: Gear Ratios



### Part 1



You and the Elf eventually reach a gondola lift station; he says the gondola lift will take you up to the water source, but this is as far as he can bring you. You go inside.



It doesn't take long to find the gondolas, but there seems to be a problem: they're not moving.



"Aaah!"



You turn around to see a slightly-greasy Elf with a wrench and a look of surprise. "Sorry, I wasn't expecting anyone! The gondola lift isn't working right now; it'll still be a while before I can fix it." You offer to help.



The engineer explains that an engine part seems to be missing from the engine, but nobody can figure out which one. If you can add up all the part numbers in the engine schematic, it should be easy to work out which part is missing.



The engine schematic (your puzzle input) consists of a visual representation of the engine. There are lots of numbers and symbols you don't really understand, but apparently any number adjacent to a symbol, even diagonally, is a "part number" and should be included in your sum. (Periods (.) do not count as a symbol.)



Here is an example engine schematic:



```text

467..114..

...*......

..35..633.

......#...

617*......

.....+.58.

..592.....

......755.

...$.*....

.664.598..

```



In this schematic, two numbers are not part numbers because they are not adjacent to a symbol: `114` (top right) and `58` (middle right). Every other number is adjacent to a symbol and so is a part number; their sum is `4361`.



Of course, the actual engine schematic is much larger. What is the sum of all of the part numbers in the engine schematic?



### Part 2



The engineer finds the missing part and installs it in the engine! As the engine springs to life, you jump in the closest gondola, finally ready to ascend to the water source.



You don't seem to be going very fast, though. Maybe something is still wrong? Fortunately, the gondola has a phone labeled "help", so you pick it up and the engineer answers.



Before you can explain the situation, she suggests that you look out the window. There stands the engineer, holding a phone in one hand and waving with the other. You're going so slowly that you haven't even left the station. You exit the gondola.



The missing part wasn't the only issue - one of the gears in the engine is wrong. A gear is any * symbol that is adjacent to exactly two part numbers. Its gear ratio is the result of multiplying those two numbers together.



This time, you need to find the gear ratio of every gear and add them all up so that the engineer can figure out which gear needs to be replaced.



Consider the same engine schematic again:



```text

467..114..

...*......

..35..633.

......#...

617*......

.....+.58.

..592.....

......755.

...$.*....

.664.598..

```



In this schematic, there are two gears. The first is in the top left; it has part numbers `467` and `35`, so its gear ratio is `16345`. The second gear is in the lower right; its gear ratio is `451490`. (The * adjacent to `617` is not a gear because it is only adjacent to one part number.) Adding up all of the gear ratios produces `467835`.



What is the sum of all of the gear ratios in the engine schematic?



> [Documentation](./day3.md) | [Code](./src/main/java/com/github/nggalien/advent/Day3.java)



## Day 4: