Minimum Distance in Matrix (BFS Pathfinding)

Phone ScreenSnowflakeLast reported June 2026Low Frequency

Reported: 2× across candidate reports
First seen: March 2026
Last reported: June 2026
Reported outcome: mixed

Problem Overview

Given an m×n matrix containing 0s and 1s, find the minimum distance (number of steps) from a start cell (sr, sc) to a target cell (tr, tc) without passing through any cell with…

3 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
The rest of the problem statement — full requirements, constraints, and edge cases
Approach and trade-offs — what passing candidates did, and the mistakes that sink people

Unlock the full Snowflake catalog

Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Snowflake question.

Unlock with Pro

Already a member? Sign in

Verified Source

Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.

Codex Fact-Checked

Technical claims, formulas, and scale numbers are reviewed against primary sources.

Interviewer Follow-ups

The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.