93
[2023 Day 3] Motivation time!
(lemmy.world)
An unofficial home for the advent of code community on programming.dev! Other challenges are also welcome!
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.
Everybody Codes is another collection of programming puzzles with seasonal events.
Solution Threads
| M | T | W | T | F | S | S |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| 8 | 9 | 10 | 11 | 12 |
Icon base by Lorc under CC BY 3.0 with modifications to add a gradient
console.log('Hello World')
Day one really got me with those pesky overlapping words like
eightwoortwone.Today was actually really easy the way I did it.
I searched through all the characters of the lines and when I got one that wasn't a number or a period, I looked at all the 8 places around to find the numbers. The numbers I completed by looking in both directions until I got a non-number.
Then I put all numbers and their starting positions in an array, deleted the duplicates and summed them.
By doing this, question 2 only took me 4 minutes.
Yeah it looks like the better solutions generally took that route. I convinced myself that the symbols were going to all have different rules in part 2, so ended up thinking about it way too hard for day 3 ๐
Thought so too, but for me it was a simple match statement (rust), which then became a glorified if statement. ๐
Hmm, I did it the opposite. Found every number and passed a list of every adjacent position of the number to check for non-digit/dot/non-whitespace.
Took a bit longer to solve part 2 due to that approach though.
In that case I was kinda lucky.
But it looked more second-partly to do it that way. ๐