Unique Paths III

Explore the Unique Paths III problem by learning how to implement backtracking algorithms to find all unique four-directional paths on a grid. Understand how to handle obstacles and ensure every empty cell is visited exactly once between a fixed start and end point.