It's great! I've had community members point me in the right direction after already "solving" it incorrectly. It really makes you think about it. You have to expand your test cases and really come up with a better solution.
Not to say it isn't difficult especially if you expect the problem to be described perfectly accurately.
I don't need a perfect instruction set, but dang if the examples couldn't be better sometimes. Like sixteen was in there to show it only counted for 6, but nothing with overlapping text.
I'm stuck on one of these intricacies now! I saw some of the ideas on how other people did it but i honestly have no clue what i did wrong. Got any tricky examples to share?
I just solved it. I printed every set of integers in the format "Result: [theTwoDigits], from string: [inputString]" and mannually checked all of them. Eventually found the edge case that was causing troubles. It was a typo.
It was for sure to catch people that were taking the easy route and using a replace. I had to rework my solution to get the start positions for the matches. That method made both parts easy to get together.
it seemed pretty straightforward in python - just make a list of text->number, use that to make the regex, then use it again to convert back to numbers
I managed the overlap logic just fine (if in a clumsy way), but spent over an hour trying to debug my crappy parser-combinator code when the issue all along was a mis-spelling in my lookup table.