Does that take ten minutes?

i got error random test of [w, e, s, n]
suppose to be true but it is flagged as false in test case.

OMG. Lost in translation.
Thanks bro

I read the description 10 times and didn't understand why ('n','s','n','s','n','s','n','s','n','s') is True and ('n', 's', 'n', 's', 's', 'n', 's', 'n', 's', 'n') is False!

In the seoond case, the walk is only 8 minutes long.

Im confused on how to find the starting point. my logic is the first and last direction should be the same but thats not correct. for example, my though is if index 0 is 'n' index 9 should also be 'n' to satisfy the 10 min and end back at the starting position. Can someone explain to me what is wrong with this logic or what im missing or what i might be misunderstanding?

Your problem is in the part you change sum value. That input gives you a value of 0.

Nice kata

call me razzed

razzing us up, are you?

I propose the following fixed test cases, possibly shuffling the chars of each one:

import itertools
print(list(map(''.join, itertools.combinations_with_replacement('nswe', r=10))))
# (length 286)

for js/py at least
could hard-code with expected since they don't have ref solutions

forks:

https://www.codewars.com/kumite/670cccade45f1ab15e20cea0?sel=670cccade45f1ab15e20cea0

https://www.codewars.com/kumite/670cce2289e815842c20ce97?sel=670cce2289e815842c20ce97

your solution is incorrect, please ask a question next time. your switch statement falls through all the way down...

Are you sure the input was that and not this one: "nsnsnsnsnsns". The tests for C with "nsnsnsnsns" expects true.