Day 3 done. This one was pretty easy.

My part 1 solution mostly generalized to part 2, but I ended up having to rewrite the whole function anyway because I didn't make it flexible enough. For part 1 I initially just scanned for the max digit in the whole line except for the right-most digit, then found the max digit to the right of that.

For part 2, I effectively generalized it, but had to calculate how many digits I was allowed to find the max in, and loop over each number of digits I still needed to keep room for. A little fiddly, but not too hard at all. I'm kind of curious if doing it arithmetically using a bigint would be faster or slower. My gut says that it would probably be slower, and just save a little bit of memory.

#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day3 #AdventOfCode2025Day03 #Day3 #Day03 #Rust #RustLang #Programming #Coding

20250610 mb05 Day 03 Wrap

#wrap #mb05 #Day03 #Gloucester

https://youtu.be/7zr539A0bMA

Choose 20 books that have stayed with you or influenced you. One book per day for 20 days, in no particular order. No explanations, no reviews, just covers. ❤️📚

­#BookSky #Books #BookChallenge #Day03
https://yadl.info/en/notes/2024/book-challenge-day-03

20240331 mb05 Day 03 Wrap

#Wrap #Day03 #March2024 #mb05 #Gloucester

https://youtu.be/76dZ-uPf3E8

I completed #Day03 of #AdventOfCode 2023.

Part 1:
- Difficulty: 3/10
- Workout: 4/10

Part 2:
- Difficulty: 1/10
- Workout: 2/10

Done in almost 3 hours. Once I understood how to check for adjacency between numbers and symbols (and vice-versa) (and ranges in general), the code for Part 1 wrote itself, bottom-up. Part 2 was just looping through Part 1 lists (of numbers and symbols) in a different order.

After some much needed refactoring, the code is down to almost 150 lines.

#Day03 topic:-

It's all about conditional statement.

#100DaysOfCode​ #js #javascript​

Resource: https://with.zonayed.me/​

@bengali_convo @mastodonindians