Cpp, Cplusplus, Programming, Software Development, Interview Questions.
Daily bit(e) of C++ #91, Common 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.