Agree swordfist

False is a correct answer in this case. North and west aren't opposite directions. In case [ 'n', 'w', 'n', 'w', 'n', 'w', 'n', 'w', 'n', 'w' ] you will not return to the start point.

I checked the tests, and that praticular test is definitey expecting your function to return false.
maybe you're not returning properly or reading the logs wrong.

[ 'n', 'w', 'n', 'w', 'n', 'w', 'n', 'w', 'n', 'w' ] does not like false. Please explain why I am getting value not expected when I return false.

There is no such test. All test cases that don't take you back to the start expect false.

There is a submission test case that does not take you back to start however will not accept false. I cannot find any edge cases in the Details section. Please explain where a walk that never returns from n and w directions should be true.

If you can't properly explain what's wrong there is nothing that can be done about it. Probably your code is just wrong.

I don't even use codewars any more because I spend more time trying to solve the error of woring with codewars than the question. I swear I just wrote code that will pass in my terminal and I just get an error on this site. Its such a waist of time now.

Please, read this: https://github.com/codewars/codewars.com/wiki/Troubleshooting-your-solution
Help us help you, we can't see your code and we can't guess what's wrong in your case.

My code works properly in my terminal: Codewars give me the error STDERROR on main should return false. There is no Standard Deviation on true and false and I've noticed codewars is glitcher that it was 2 years ago.