κ·κ¦οΈΆκ·κ¦οΈΆ ΰΉ ΰ£ βκ·κ¦βκ³β’β β§*βββοΈβ§ββββ π’. έββΉ. έβ έ.πκ³βπβ ββ.ΰ³ΰΏβ.ΰ³ΰΏ:ο½₯*β. έβ βΉ β έ.βββκ³Β·Μ©Μ©Νβ *Μ©Μ©Νβ§Νβ**π΄ππ π₯πκ·κ¦οΈΆκ·κ¦οΈΆ ΰΉ ΰ£ βκ·κ¦
Solutions for Advent of Code 2025 puzzles.
advent-of-code-2025/
βββ day_1/
β βββ solution.js
β βββ input.txt
βββ day_2/
β βββ solution.js
β βββ input.txt
βββ day_X/
β βββ solution.js
β βββ input.txt
βββ README.md
βοΈ Day 1: Secret Entrance β€· ΛΛΛ
-
Part 1: Count the number of times the dial points at 0 after each rotation
-
Part 2: Count every time the dial passes through 0 during any rotation
βοΈ Day 2: Gift Shop β€· ΛΛΛ
-
Part 1: Find invalid product IDs that are a pattern repeated exactly twice
-
Part 2: Find invalid product IDs where any sequence of digits is repeated at least twice
βοΈ Day 3: Lobby β€· ΛΛΛ
-
Part 1: Find the maximum joltage by selecting exactly 2 batteries from each bank
-
Part 2: Find the maximum joltage by selecting exactly 12 batteries from each bank (while maintaining digit order)
π Day 4: Printing Department β€· ΛΛΛ
-
Part 1: Count rolls of paper (@) that can be accessed by a forklift (fewer than 4 adjacent rolls)
-
Part 2: Simulate the removal process and count the total number of rolls that can be removed
Each day has its own solution file and input file. To run a solution:
node day_X/solution.js