Minimum Obstacle Removal
A grid has 0 (empty) and 1 (obstacle). Moving 4-directionally from the top-left to the bottom-right, print the minimum number of obstacles that must be removed.
Constraints
1 <= r*c <= 10^5
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.