Quick Overview

Return one deterministic shortest path through an eight-directional binary grid using breadth-first search. Learn parent tracking, ordered neighbor exploration, blocked-endpoint handling, and efficient path reconstruction.

Return a Shortest Path Through a Binary Grid

Company: Meta

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Return one deterministic shortest path through an eight-directional binary grid using breadth-first search. Learn parent tracking, ordered neighbor exploration, blocked-endpoint handling, and efficient path reconstruction.

Read the full Meta Software Engineer interview experience this question came from

Loading…