Coding (Algo)

Shortest Clear Grid Route

Algorithm: Breadth first search Difficulty: Medium Time: 35 minutes

Goal

Return the minimum number of moves from the top-left to the bottom-right clear cell or -1 if no route exists.

What this task practices

Shortest Clear Grid Route 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 medium 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.