warrence/AdventOfCode2025
1
0
Fork 0
Code Actions Activity

Add solution for "Day 3: Lobby", part 2

Browse Source
This commit is contained in:
Stefan Müller
2026-01-30 20:04:20 +01:00
parent 4b747e3705
commit a3a9eb0e45
4 changed files with 28 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files
README.md
+6
View File
@@ -24,6 +24,12 @@ Firstly, we calculate directly the sum of invalid IDs composed of two identical
On top of that we use a cache to avoid recalculating prime factors and certain helper variables for given ID lengths and repetition counts.
### Day 3: Lobby
:mag_right: Puzzle: <https://adventofcode.com/2025/day/3>, :white_check_mark: Solver: [`Lobby`](src/solvers/lobby.rs)
With a continuously updated tally of the current best joltage initialized at zero, we go once through each digit string from left to right and try to maximize the digit with the highest posiible significance in our joltage as we go, as long as the less significant digits in the joltage are not more than what remains in the string. If a better digit was encountered, all less significant digits are reset to zero.
### Day 4: Printing Department
:mag_right: Puzzle: <https://adventofcode.com/2025/day/4>, :white_check_mark: Solver: [`PrintingDepartment`](src/solvers/printing_department.rs)