Shortest path in a grid with obstacle elimination
A grid has empty cells and obstacles. Find the fewest steps from the top-left to the bottom-right cell moving up, down, left or right, when you may remove up to k obstacles along the way. Return -1 if the target cannot be reached.
MercorTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.