Math Fundamentals18 sections · 814 units
Open in Course

Problem - Unique Paths II

(LeetCode 63 - Obstacles)

Same as Unique Paths, but now some cells have obstacles. You cannot pass through obstacles. Count the number of paths from top-left to bottom-right.

Example: If the grid has an obstacle at (1,1)(1, 1), any path through that cell becomes invalid.

How does an obstacle change the counting?