A bit of thought shortcut on my part, what I meant is that if you understand what this kata is about answer to your question is trivial, but without you stating what you know and what you don't, there's no way to tell what explanation you expect.

Read this paragraph of FAQ to see what input causes your solution to fail, and then reproduce the failing test case locally and debug through it in your IDE.

Curently your solution fails for input [n, w, n, w, n, w, n, w, n, w], (it returns true, but should return false) but when you fix this one, there will be probably other problems.

Read this: https://github.com/codewars/codewars.com/wiki/Troubleshooting-your-solution#print-input

Your code fails with walks like this for instance: 'n','n','n','n','n','w','w','w','w','w'.