One question: I found many solutions for this exercise plus my oown solution. But I think the if you submit your solution, 99% HackerRank will not accept it and its test cases will prompt failurea because of time limit Exceed. Does anybody have the same experience?

I don't understand the challenge here. In the go version, the function gets just n, s and an array of knights.

And the command array is constructed, but then nothing happens with it.

Isn't that a bug? How is the function supposed to calculate where the knights are, if there command array is never used? Or what am I missing?

detailed explaination and full java code: https://github.com/Lhhiep-maxcode/DSA

Here is my solution in java, javascript, python, C, C++, Csharp HackerRank King Richard’s Knights Solution

Here is the solution of King Richard's Knights Click Here