my program is not able to come out of while loop in findMinSquares() function, please tell me what I have missed.
my code:- https://ide.codingblocks.com/s/269927
my program is not able to come out of while loop in findMinSquares() function, please tell me what I have missed.
my code:- https://ide.codingblocks.com/s/269927
i dont think this can be done using bfs approach this is a dfs+ backtracking approach based question
where u need to keep track of maximum no of steps that are traverses ky knight in the journey