this post was submitted on 02 Dec 2024
30 points (100.0% liked)
Advent Of Code
913 readers
95 users here now
An unofficial home for the advent of code community on programming.dev!
Advent of Code is an annual 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.
AoC 2024
Solution Threads
| M | T | W | T | F | S | S |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 18 | 20 | 21 | 22 |
| 23 | 24 | 25 |
Rules/Guidelines
- Follow the programming.dev instance rules
- Keep all content related to advent of code in some way
- If what youre posting relates to a day, put in brackets the year and then day number in front of the post title (e.g. [2024 Day 10])
- When an event is running, keep solutions in the solution megathread to avoid the community getting spammed with posts
Relevant Communities
Relevant Links
Credits
Icon base by Lorc under CC BY 3.0 with modifications to add a gradient
console.log('Hello World')
founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Thanks. I felt very deflated after struggling with something seemingly so simple. I was using Go and couldn't figure out part 2, at least without nesting loops three layers deep.
Today I decided to try to learn Elixir instead and allowed myself some assistance from Claude.ai, which was much more fun.
Nesting loops is indeed the first intuition anyone would have to that problem. The only reason I knew to use a hashmap data structures is because I practiced on exactly these kinds of problems, and looked up explanations and answers on the most basic stuff imaginable.
Definitely not simple. Especially without training in DSA. You shouldn't expect yourself to spontaneously invent efficient algorithms to problems that have been stumping students for decades.
Try it out yourself for maybe 30 minutes, then do yourself a favour and look up a good explanation to solving it.
My hope for this year is that we can help eachother understand and solve these problems. I'd love to find some good "editorials" on each problem, breaking them down in detail.
Yes, I guess I held myself to too high expectations. I haven't even studied CS and learned programming on my own... I've been trying to do some exercises and a few courses on algorithms but of course that can't be compared to going to university. Thanks for the tip, I won't spend hours in frustration in the coming days for sure. Maybe I should post my attempts even though they are incomplete or fail, to spark discussion.
I would love to see some attempts and discuss alternatives, improvements, etc