Unique Paths III

Understand how to apply backtracking to find all unique four-directional paths from start to end in a grid. Learn to navigate obstacles, visit all empty squares exactly once, and implement solutions in C++ for coding interviews.