Problem Statement
Count paths avoiding obstacles in grid.
Approach
dp[i][j] = dp[i-1][j] + dp[i][j-1], set 0 for obstacles.
Time & Space Complexity
Time O(m×n), Space O(n).
This experience deserves a bigger screen
The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview