Wiki Page Shortest Path / BFS Traversal

Phone ScreenSnowflakeLast reported September 2026Medium Frequency
Reported
4× across candidate reports
First seen
April 2025
Last reported
September 2026
Reported outcome
mixed

Problem Overview

Given a start wiki/web page and a target wiki/web page, find the minimum number of clicks (hops) needed to navigate from the start page to the target page. You are provided a helper function (e.g., get_all_links(page)) that returns all outgoing links (child pages) from a given page.…

  • 4 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.
Is this helpful?