Cpp, Cplusplus, Programming, Software Development, Interview Questions.
https://compiler-explorer.com/z/joa9cM3fb. Solution Finding the shortest path is a canonical problem for the breadth-first search algorithm. The tricky part, of course, is dealing with removing obstacles. However, consider the following. What if removing an obstacle would instead move us to another