Me too :/

suppose you are at 0,0 index n will move up s will move down w to move left and e for move right , try this logic on paper you will understand

read the description again and then carry it out manually. pen and paper maybe?

why n, e, n, e, n, e, n, e, n, e - should return false (my code returns false its ok)
but n, s, n, s, n, s, n, s, n, s - should return true? (my code returns false - and test say that it's incorrect, but idk why)

1st test is from "should return false if walk does not bring you back to start"
2nd test is from "should return true for a valid walk"

ok, i give up, my code working but idk how to do this in one line :/