Shortest Path in Grid with K Wall Breaks

Question

Find the shortest path from the top-left to the bottom-right of a binary grid, allowed to eliminate at most `k` obstacle cells along the way. Standard BFS plus a `remaining-breaks` state dimension.

Bloomberg interview candidates · Answer

Community-reported Bloomberg interview question with 2 related discussions. The full write-up and related discussions are available to members.

Comments