Skip to content

lassiecoder/advent-of-code-2025

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

12 Commits
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

Advent of Code 2025

κ’·κ’¦οΈΆκ’·κ’¦οΈΆ ΰΉ‹ ΰ£­ ⭑꒷꒦⋆꙳‒❅‧*β‚Šβ‹†β˜ƒοΈŽβ€§β†β‚Šβ‹†β…π–’”. έβ‚ŠβŠΉ. έβ‚Š ݁.π‚‚κ™³β‹†π™šβ…β‹†β†.ೃ࿔❆.ೃ࿔:ο½₯*❆. έβ‚Š ⊹ β‚Š ݁.β‚Šβ‹†β‹†κ™³Β·Μ©Μ©Ν™β…*̩̩͙‧͙⋆**𓃴𓃙𓃠π“ƒ₯π“ƒšκ’·κ’¦οΈΆκ’·κ’¦οΈΆ ΰΉ‹ ΰ£­ β­‘κ’·κ’¦

Solutions for Advent of Code 2025 puzzles.

Project Structure

advent-of-code-2025/
β”œβ”€β”€ day_1/
β”‚   β”œβ”€β”€ solution.js
β”‚   └── input.txt
β”œβ”€β”€ day_2/
β”‚   β”œβ”€β”€ solution.js
β”‚   └── input.txt
β”œβ”€β”€ day_X/
β”‚   β”œβ”€β”€ solution.js
β”‚   └── input.txt
└── README.md

Days Completed

❄️ 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

    Solution (❛ ֊ ❛)

β˜ƒοΈŽ 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

    Solution (❛ ֊ ❛)

β˜ƒοΈŽ 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)

    Solution (❛ ֊ ❛)

πŸŽ„ 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

    Solution (❛ ֊ ❛)

How to Run

Each day has its own solution file and input file. To run a solution:

node day_X/solution.js

About

AOC 2025 solutions – Saving Christmas, one puzzle at a time! πŸŽ„

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published