what is the time complexity of rat in a maze problem using recursion and backtracking as implemented in the video?
Rat in a maze time complexity issue
hi,
the time complexity would be 2^N n is no of rows assuming to be a square matrix
in case it is not a square matrix max of row or column