The language is very hard to understand. can i get a proper solution to this problem. I am sorry to say but I find most video by Apaar sir very unclear.
The hint is very unclear
What we have to do is find the minimum number of squares that the knight can not reach under the constraint that the knight may not move to any square that is not on the board and cannot rest in any spot more than once .
You can solve this problem using recursion with backtracking . once you visit a cell, then visit all the cells that can be visited from this cell and also visit the cells that can be further visited from the next reachable cells. and keep tracking the number of cells you have visited in one traversal until there is no cell that you can visit further ,also keep marking the visited cell so that you don;t visit those cells again
refer this code for better understanding :- https://ide.codingblocks.com/s/263821
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.