I just completed "Ceres Search" - Day 4 - Advent of Code 2024 #AdventOfCode adventofcode.com/2024/day/4 Eh...wouldn't have done it this way if I had known P2 was going to be unrelated. I tried to predict what they might ask for in P2 so overdid P1 I think. github.com/thisisjeffsn... - ThreadSky

thisisjeffsnow.com • 86 days ago

I just completed "Ceres Search" - Day 4 - Advent of Code 2024 #AdventOfCode https://adventofcode.com/2024/day/4

Eh...wouldn't have done it this way if I had known P2 was going to be unrelated. I tried to predict what they might ask for in P2 so overdid P1 I think.

https://github.com/thisisjeffsnow/advent-of-code/tree/main/2024/04

Comments

rob.tsuk.com•86 days ago

I see what you mean.

cds-amal.bsky.social•86 days ago

Nice! I’m stuck on part two，I made a bad choice for part 1. Looking forward to coding time later.

dv48.bsky.social•86 days ago

I assumed the letters could change direction at each step and that's wrong, so I have to spend some more time.

aivanov.bsky.social•86 days ago

Can't the direction change at each letter?

thisisjeffsnow.com•86 days ago

For day 4 part 1? No, the word XMAS has its letters adjacent to one another in either a row, or column, or diagonal.

aivanov.bsky.social•85 days ago

Thanks! I thought it could go in any direction at each letter. Maybe the sample could've been clearer.

thisisjeffsnow.com•85 days ago

The sample could be much clearer by demonstrating exactly which strings were valid by circling them just like you would in a word search. Agreed.

bouffe.io•86 days ago

Same, when I saw the part 2 I immediately though "what? I shouldn't have done that in part 1"

nigelanderton.bsky.social•86 days ago

Enjoyed today, got a bit carried away and added a trie search for multiple words and a ‘solved’ output.

thisisjeffsnow.com•86 days ago

How festive. That's so cool!

iamapot.bsky.social•86 days ago

Hey how did you solved day3 problem.

thisisjeffsnow.com•86 days ago

I counted the number of positive differences, the number of negative differences, and the number of unsafe distances (0 or bigger than 3). As long as unsafe is zero and either positive or negative differences are 0, then it's safe.

baileybrayton.com•86 days ago

Isn’t that day 2? Day 3 was the do() and don’t()

thisisjeffsnow.com•86 days ago

Yep, I need to relearn my integers. Oof.

iamapot.bsky.social•86 days ago

No day2 was Red-Nosed Reports

thisisjeffsnow.com•86 days ago

Right, I gave you my solution for day two instead of day three like you asked. I used regex for day 3 and just iterated the matches carefully with toggle.

thisisjeffsnow.com•86 days ago

For part two, I took a copy of those counts from part 1, and then for each element in that row of reports, I modify those tallies, and check to see if that makes it safe.

llamnuds.bsky.social•85 days ago

Yes it did go off at a tangent somewhat.

treboryug.bsky.social•86 days ago

I spent way too much time solving this. Over 2 hours... 😱
But at least, I am happy with the result 😂

larkenciel.bsky.social•86 days ago

I feel smart if it takes me less than two hours! I am super slow with algo stuff but I really enjoy it and it's probably a better use of my time than Tears of the Kingdom, AGAIN. lol

jc.dubacq.fr•85 days ago

I also overengineered part 1 in day 4, but it somehow has been in the right direction for a quick part 2

danecarstens.net•85 days ago

P1 was only over-engineered cause I'm dumb and took wayyyy too long to get a functional word search. But once I did, adapting it to P2 was honestly trivial? Hopefully your guessing pays off on day 5 :)

dfx-ng.bsky.social•86 days ago

The second part was actually easier then the first once. Didn't expect that.

Comments

Posting Rules

Reply