Back

Sunday common C++ interview problem: Shortest path with obstacle removal

Given a 2D grid of size m*n, containing 0 (space) and 1 (obstacle), determine the shortest path from the coordinate {0,0} to {m-1,n-1}, given that you can remove up to k obstacles.

If no path exists, return -1.

Solve it yourself: https://compiler-explorer.com/z/joa9cM3fb
Solution: https://compiler-explorer.com/z/9GdMfod6G