PYTHON PROBLEM 174 · Interview-Level

Count unique paths with obstacles

Count right-and-down routes that avoid a blocked cell.

grid DP · space optimization · company screengrid DPspace optimizationcompany screen

PROBLEM OVERVIEW

What this Python exercise asks you to practise

This scenario tests count unique paths with obstacles. It belongs to the Dynamic Programming roadmap and uses the grid dp · space optimization · company screen pattern.

State design, recurrences, memoization, tabulation, optimization, and overlapping subproblems.

COMPLETE WORKSPACE

Learn the plan, trace the logic and run the solution

Complete access unlocks the full statement, two verified examples, visual execution plan, hints, browser compiler, solution and line-by-line interpretation.

Unlock all 180 lessons · ₹599One full year · one payment · no automatic renewal

SKILL TO CARRY FORWARD

Pattern relevance

This exercise strengthens grid dp · space optimization · company screen. Be ready to explain the input, the rule, the boundary cases, and why the chosen approach is appropriate.