Solution: Unique Paths III

Explore the backtracking technique to solve Unique Paths III, where you compute all four-directional paths from a start to an end cell, visiting every empty square exactly once. Learn to implement a recursive approach that tracks visited squares, avoids obstacles, and counts all valid paths while managing time and space complexity efficiently.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

You are given a $m \times n$ integer array, grid, where each cell, grid[i][j], can have one of the following values:

1 indicates the starting point. There is exactly one such square.
2 marks the ending point. There is exactly one such square.
0 represents empty squares that can be walked over.
-1 represents obstacles that cannot be crossed.

Your task is to return the total number of unique four-directional paths from the starting square (1) to the ending square (2), such that every empty square is visited exactly once during the walk.

Constraints:

$m$ $==$ grid.length
$n$ $==$ grid[i].length
$1 \leq$ ...