Task requires using "spread operator" but there's no reasonable way to use that here and none of the top solutions have it. I spent a while trying to figure out where to use it before finally "giving up" and submitting my solution that used everything else. Made the problem frustrating/unenjoyable.

FYI this won't work in strict mode without let [a,b]. See my fork.

I think the count(n)=count(s) solution is cleaner and slightly more efficient. It makes 41 comparisons whereas this one makes 43 (2 more in last line) and creates var x,y and sets them to 0.

This is wrong. Test cases need to be fixed. n: 5, w: 5, s:0, e: 0 would return True even though you would be 10 steps away from where you started.

@oddone Your solution is incorrect (bad test cases). Consider n:0, e:5, s:0, w:0.

Wrong Location: (0,5) != (0,0) & Wrong Distance len(walk) != 10 but returns True!

walk.count('n') + walk.count('e') == 5 and walk.count('n') == walk.count('s')
0 + 5 == 5 and 0 == 0
#True

I fixed it in a fork. Note that "n" is "y -+ 1". Two mistakes.

@mmircevska Yes it would return False immediately! Using and is as effective as your if test.

and & or are very efficient. False and whatever will return False before looking at whatever. True or whatever will return True before looking at whatever.

print test
#NameError: name 'test' is not defined
print False and test
#False, would've thrown error if eval'd test
print True or test
#True