I tried this approach where I calculated all the possibilities where the knight can go, and then I compared it with the chess board.
Can you please tell me whats wrong with my approach.
Getting wrong ans for two test cases
i have explained this question in the class today,
please see the sol here, its easy , there is little confusion in the problem statement
goto recursion folder
1 Like
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.