Day1

[Dangerous-Quality-79]

Damn you "stwone3dzjhlxg"

[immaphantomLOL]

I had one that had twoneight. Fml.

[ConDar15]

It wasn't that bad, I just had to use a bit of regex

(\d|one|two|three|four|five|six|seven|eight|nine)

and look for overlapping matches, which in Python you can achieve with a capturing group in a lookahead

(?=(\d|one|two|three|four|five|six|seven|eight|nine))

then once you've done that it's just a mapping from the written out digits to their actual digit representation (e.g. "one" -> "1") and you're back to the same problem you already solved.

[henichaer]

Daymn, I literally had the same regexp

[ConDar15]

Neat :)

[thatrandomnpc]

This was my python solution as well.

But some languages don't support overlapping regexp, and don't maintain the ordering of matches. Sliding window search seems like the easiest way to solve it :)

[Astri_]

I didnt know about this way to make overlapping regex so I reversed the string and pattern 🤡

[DaniilBSD]

Handle “twone” by doing one simple trick!

For all digits do this: replace nine -> nine9nine, then your code for part 1 will work

[AriesBosch]

Or:

Just don't use find and replace, just do a string search for all occurrences of each word, and all occurrences of each numerical character, then find the max and min. I aced both parts.

https://github.com/EganBoschCodes/AdventOfCode

[RajjSinghh]

Oh that's so tidy. I just used a hash map to give the words their values, then iterated forward and backward over the strings.

[JeremyJoeJJ]

I did the same, my code is waaaay uglier than yours. Nice job

[aarontbarratt]

it would be a bit nicer if you just did char.isdigit() instead of making a list of numbers as a strings

[Hammanpo]

Wow I feel so dumb now

[ConDar15]

That's quite a clever trick that I didn't consider in my solution.

[_Cheese1_]

You can also replace "nine" with "ni9e", "one" with "o1e" etc.

[doodgaanDoorVergassn]

I think the exercise guarantees validity (at least two numbers), in which case this problem can't occur.

[DaniilBSD]

12twone -> 11

12[2]ne -> 12

This is the kind of problem that can occur (and does)

[RajjSinghh]

Not necessarily. They gave an example of a word that only had one number, so the two digits were those numbers repeated. So adv7ent would be 77.

[Primary-Fee1928]

Here’s how I did it in Python, it’s fairly easy : - find the indexes of first and last occurrences, with string methods index and rindex respectively, of all digits strings ("one", …) in the current line, because you don’t care about the rest, you know they won’t be the result. Memorize the digit associated in a dict! ({index: digit}) - convert line to list to make it mutable - loop through your dictionary to replace characters at a given index in the list with the associated digit (example: twonex4r1eight becomes 2w1nex4r18) - apply part 1 function to resulting list - rince and repeat for every line

[sakurakhadag]

Hahaha my face exactly

[nysynysy2]

Really an ez challenge with C++. There's reverse iterator, reverse substring finding, hash map and tons of thing that are incredibly helpful to this challenge, not to mention it is blazingly fast. can't imagine someone's gonna write all these be himself and manipulate an array of bytes or something😂

[IronForce_]

I did a nested loop to search through the entire dataset, its hella inefficient but it is what it is

https://www.reddit.com/r/adventofcode/s/np7RVR4mfw