totally missed that! thanks for the feedback :)

Thanks! Many other broken solutions have been invalidated as well. Nice!

Approved C translation. This solution is no longer valid.

I forked the C translation and added code to test all combinations of counts of n,s,e,w. This should invalidate most broken solutions, for example the one above.

Please have a look and approve the translation. Thanks!

(I didn't check the tests of other translations, but I also solved Java, Rust and Haskell, and their tests seem to be thorough enough.)

Fork all the translations and add the tests you think are missing.

Nice and short, but broken – it returns true for "nnnnnnnnns" and similar paths. The tests should be improved, and this solution should be invalidated.

amazing!