Unique Paths III

Explore the application of backtracking to solve the Unique Paths III problem. Understand the grid setup with starting, ending, empty cells, and obstacles, then develop a solution to count all unique four-directional paths that visit every empty square exactly once.