โ Adobe questionsShortest Path in Grid with Obstacles
Filed under Adobe
Find the shortest path from (0,0) to (m-1, n-1) in a grid with obstacles (1s) and empty spaces (0s), allowing at most k obstacle removals.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.
Collected from public candidate posts and coding forums. Updated Nov 2026.