This was fun. started out using regex but soon found out I didnt need it. I had to re-code it 3 times because I kept forgetting to group
Letters and numbers. The solutions always make me feel inadequate because i use more code but Im happy with this either way.
I think this is my problem:
"Matches should be case-insensitive, and the words in the result should be lowercased."
So does this mean as long as its the same word, matching string, it doesnt matter if its Aaa or aaA it still matches?
and The only thing that can be returned are nmatches thatwere lowercase all around, or you have to change the matche to
lowercase?
I think this is whats giving me problems cause i only seem to be having problems on the random tests with a shit load of caps.
Suffering is part of the programming path, if you don't suffer, you don't grow in knowledge.
Did we really let this person suffer for 4 years?
Just iterate and keep track of non-null values, my friend.
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
I am in the exact same position. I've tried counting up, counting down, seemingly all that I can think of.
i finally got and then figured out 2 ways to solve it shortly after this. was a matter of one small miscalculation.
Especially after trying a lot of things on your own, is good to check google as well from time to time :)
This was fun. started out using regex but soon found out I didnt need it. I had to re-code it 3 times because I kept forgetting to group
Letters and numbers. The solutions always make me feel inadequate because i use more code but Im happy with this either way.
This one is confusing. Instructions say u0 but to get rhe grid ad expectedd tou have to go down
maybe it passed that one and timed out further in.
['Tom Marvolo Riddle', 'I am Lord Voldemort', 'Harry Potter'] Really?
This looks like it could be fun, but the description is horrible.
Did it twice. Lookup table was faster and cleaner. Gonna keep working at it and see if i can get the code even smaller without any imports at all.
I think this is my problem:
"Matches should be case-insensitive, and the words in the result should be lowercased."
So does this mean as long as its the same word, matching string, it doesnt matter if its Aaa or aaA it still matches?
and The only thing that can be returned are nmatches thatwere lowercase all around, or you have to change the matche to
lowercase?
I think this is whats giving me problems cause i only seem to be having problems on the random tests with a shit load of caps.
That was the easiest 5 Ive seen.
Loading more items...