Problem Statement: Given a N*N board with the Knight placed on the first block of an empty board. Moving according to the rules of chess knight must visit each square exactly once. Print the order of each cell in which they are visited on the chess board.

I was attempting the word search problem here on leetcode. Leetcode seems to give me an error for the two test cases:

I was attempting the word search problem here on leetcode. Leetcode seems to give me an error for the two test cases:

I was attempting a recursive solution to the n queens problem. Please take a look at this code: