Total paths in a grid with obstacles
Filed under Uber
The question
Given an n x m grid with values 0 (blocked) and 1 (allowed), calculate the total number of unique ways to reach the bottom-right corner from the top-left corner moving only right or down.
No write-up yet. Related questions below have one.
Related Uber questions
Collected from public candidate posts and coding forums. Updated Nov 2026.