↖ ↑ ↗

← S →

↗ ↓ ↘

has only one ENTERANCE to S. So, Why not start from here and run backwards?

Your trick "Math.atan2(X, Y) / Math.PI" is clever for not ruining the continual symmetry like: const chars = "S↖←↙↑↓↗→↘"

Quite unreadable code for the unexperienced eye but have great pedagogical value. Congratulations.

I got the same problem too. Embedded an exclusion in my function to pass the tests.

Same here :(

Where?

You are leaving out the first and the last word of the string.

Works perfect in F12 Chrome , bu gets NaN from Node compiler. Tested a ton times. Furious ,

you need to conform your code to the language versions availble here.

I do solve the problem in the browser. But test compiler doesn't recognise .flat() .split("") commands and throws errors.

Perfection.

javascript is not good with too much recursions. You may try async functions and wait() promises.

Didn't understand well. How does it filter repetiting chars?
is this operation O(n) or O(n^2). isn't filter sequential?