-
Notifications
You must be signed in to change notification settings - Fork 88
Add blog post for day 03 / 2025 #866
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
Added detailed explanations and Scala solutions for both parts of the puzzle, including input examples and algorithm descriptions.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Pull request overview
This PR adds comprehensive documentation for day03 puzzle, including detailed explanations of the problem, examples, and Scala solutions for both Part 1 and Part 2.
Key Changes
- Added input format description and examples
- Implemented Part 1 solution using nested loops with O(n²) complexity per line
- Implemented Part 2 solution using a recursive greedy algorithm to find the largest N-digit number
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks! i did something similar, but just not recursive
Added detailed explanations and Scala solutions for both parts of the puzzle, including input examples and algorithm descriptions.