Can anyone explain me how to optimize the backtracking algorithm of Knight Tour so that it passes all the testcases. Also, where can I find detailed explanations and solutions to cses problems? I found a explanataion of graph problems by some guy in codeforces but I was unable to understand what I have to sort in the knight tour.

I got an email about being plagiarized in the contest for the second question i.e. problem B. The solution is very straightforward and that's why the system checking might have made a mistake while comparing the solution. The 2 submissions are mine and the ID which submitted a similar solution as mine, I have been threatened in the mail that my account is gonna be banned. Please look after your system because I got this notice for the second time.

[contest:2049][user:MikeMirzayanov][user:warrioroo]

I got an email about being plagiarized in the contest for the second question i.e. problem B. The solution is very straightforward and that's why the system checking might have made a mistake while comparing the solution. The 2 submissions are mine and the ID which submitted a similar solution as mine, I have been threatened in the mail that my account is gonna be banned. Please look after your system because I got this notice for the second time.

[contest:2049][user:MikeMirzayanov][user:warrioroo]