Summary for those just joining us:
Advent of Code is an annual Christmas themed coding challenge that runs from December 1st until christmas. Each day the coding problems get progressively harder. We have a leaderboard and pretty good turnout, so feel free to hop in at any time and show your stuff!
Whether you have a single line monstrosity or a beautiful phone book sized stack of OOP code, you can export it in a nice little image for sharing at https://carbon.vercel.app
What did you think about today's problem?
Our Code is 2416137-393b284c (No need to share your profile, you have the option to join anonymously if you don't want us to see your github)
Jump in the discussion.
No email address required.
Questions that require looking at the input should be illegal. You solve for example, you change filename, it just werks.
Jump in the discussion.
No email address required.
You should be able to anticipate edge cases not in the example but otherwise I agree
Jump in the discussion.
No email address required.
More options
Context
More options
Context
I managed to quickly identify that part 2 was another LCM question but then I got stuck for like an hour due to an off-by-one issue (needed to add +1 to the cycle lengths because I iterated from 0)
Jump in the discussion.
No email address required.
More options
Context
My friend who wakes up to do them texted me "wtf" so I'm pretty scared. Looks OK though? Just a stack and storing a boolean state on each node...
Jump in the discussion.
No email address required.
More options
Context
First the text for the example for part 1 makes it seem like you should multiply the final answer by 1000.
Then for part 2, apparently you aren't supposed to code a general solution, but instead look at the input, and once again assume that lcm works? The computer's supposed to do the work, not me.
Jump in the discussion.
No email address required.
More options
Context
Jump in the discussion.
No email address required.
More options
Context
i really like this one
Jump in the discussion.
No email address required.
More options
Context
Part 1 was neat, part 2 sucked. Got distracted by the 2 layers of conjs as if it wasn't tedious enough already.
Jump in the discussion.
No email address required.
More options
Context
Make that three days in a row where the trick was something seen in a previous challenge.
When my random test answer of 100 billion returned too low I knew it would be more LCM frickery, and the example it gives very heavily hints toward "you only reach the end node when all parents are sending a high pulse" so I assumed there must be regular cycles.
Jump in the discussion.
No email address required.
More options
Context
Part 1 is nice, Part 2 is a bit rough today. Trying to brute force it is unwise.
I don't see an obvious way of universally solving Part 2 without inspecting the graph. It's only by doing that that you're able to spotthe single conjunction node above the target node, allowing you to find cycles for each input and lcm the result . Not really much of a coding challenge so much as a test of graph theory, which I kinda suck at.
Jump in the discussion.
No email address required.
More options
Context
Bad day today. I spent more time fighting compilation errors than I did figuring out the problem.
Jump in the discussion.
No email address required.
More options
Context
Snapshots:
https://carbon.vercel.app:
ghostarchive.org
archive.org
archive.ph (click to archive)
https://adventofcode.com/2023:
ghostarchive.org
archive.org
archive.ph (click to archive)
Jump in the discussion.
No email address required.
More options
Context