Unique Paths III

Understand how to apply backtracking to solve the Unique Paths III problem where you find all paths from start to end on a grid that visit every empty cell exactly once. Learn to navigate obstacles and explore four-directional moves to implement an effective solution.