Quick Overview

This question tests a candidate's practical grasp of graph traversal algorithms applied to 2D grid problems, specifically BFS for unweighted shortest-path search. It is a standard coding interview problem that assesses the ability to model spatial constraints, handle edge cases like disconnected graphs, and reason about time and space complexity at scale.

Shortest Path in a Grid with Blocked Cells

Company: Uber

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Quick Answer: This question tests a candidate's practical grasp of graph traversal algorithms applied to 2D grid problems, specifically BFS for unweighted shortest-path search. It is a standard coding interview problem that assesses the ability to model spatial constraints, handle edge cases like disconnected graphs, and reason about time and space complexity at scale.

Loading…