Coding (Algo)

Map Repair Budget

Algorithm: Breadth first search Difficulty: Hard Time: 65 minutes

Goal

Find the fewest moves from the top-left to bottom-right cell with at most k obstacle entries.

What this task practices

Map Repair Budget is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as hard difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.