can you please explain me the logic of this problem with an example. i couldn’t get the logic to the answer which have to find
Funky chess board
@aavaigrocks2001, the question is quite simple basically what we need to do is to find a path in which we get the minimum number of unvisited cells , which is same as total number of valid cells - longest path you can traverse , so the question reduces to the longest path we can traverse under the constraint that we are not visiting the same cell more than once and always visit a valid cell i.e. we can’t visit a cell out of bound or with value 0,
for detailed discussion of the concept and solution refer below link :-
In case of any doubt feel free to ask 