ugh, and here I am trying to use math LOL

nice one bro! how can i do the same for any problem statements?

Well, you can do it in O(n) but even simpler is just to exit early if len(walk) is not 10. Then it doesn't matter how long the list is, you will only ever iterate over it if the length is 10. Therefore, any difference in efficiency will be insignificant.

Brilliant !

I went over and made a list to do all this! Brilliant

likewise...
I've been playing with coordinates while we just needed to compare counts of directions...
Well it was fun anyway, thanks!

I feel dump

Smort

this is my first solution. but i feel it is O(5n) and with simple for .. you can do it just O(n)

I feel more dumper than I actually is... after seeing this solution

I compared against my solution and you got the 'e' and 'w' the wrong way round.

I have almost the same solution, but thought I had to have "or False" after that. Didn't know I could just write it like this. :)

When you solve a problem, it gives you the option to rate it. When you rate a coding challenge you also get +1 honor.

Sometimes when I feel a coding challenge is not well-explained and I want to negatively rate it, I unlock the solutions, copy one, "solve" the challenge and then rate it with Satisfaction = "NONE".

lol