Available question text
Count the number of distinct paths from the top-left to bottom-right of an m×n grid when you can only move right or down and cells marked 1 are impassable obstacles. This is a grid counting/DP problem with m,n ≤ 100 (answer ≤ 2×10^9).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Meta
Leetcode 63. Unique Paths II
Reported Sep 13, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceMicrosoft
Leetcode 63. Unique Paths II
Reported Nov 8, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source