Suggestion: Mark the phrase "and will, of course, return you to your starting point" in bold or rephrase it to point out that the given path must return you to the startying point. (not a native speaker here.)
I ended up in a situation where I was not back at the starting position but still had time to find my way back on my own. I thought this is a valid solution, but it wasn't and only after pondering over the strict sense of the instructions many times I realized I was spending way to much thinking into that problem than I had to.

Here's a Clojure translation.
I'd really appreciate if you could review and approve it!

Please have a look at this Kotlin translation and approve it. Thanks!

I didn't change anything in the original Kotlin translation created by melli0620, I just updated the description.

What are valid color values? Which values can be safely used as 'guard'? That is not clear from the description.

D translation

• Go translation
• Rust translation

(author is inactive)

Kotlin translation ready for review and approval.

Haskell translation

In the JavaScript translation, the answer for the following is expected to be { black: 5, white: 2 }. Could someone explain where the second white comes from?

answer = [1, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2, 2, 3, 3, 3]
guess  = [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
          w  b  b           b  b  b

For comparison, I've used the following, which expects {black: 1, white: 0}

answer = [1, 2, 3, 4]
guess  = [1, 1, 1, 1]
          b

The type should be :
('n' | 's' | 'e' | 'w')[]
and not :
string[]

as the description of the test describe.

The base code should be :

export function isValidWalk(walk: ('n' | 's' | 'e' | 'w')[]) {

}

Hello im just so buffled and i didnt really get it i have my code now but the question has some points that didnt really explain clearly like this
Assert::That(isValidWalk(V{'n','s','n','s','n','s','n','s','n','s'}) // it is true since the size is 10

Assert::That(isValidWalk(V{'e','w','w','w','n','w','w'}) // SHOULD BE TRUE??? btw this is the input of the test .. how come this is true when every char is 1 min and this isnt even in 10 minutes just like the author said