Traverse All Reachable Pages With Parallel BFS

Company: Snowflake

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Return every web page reachable from a starting page in stable breadth-first discovery order, including the start exactly once. Handle cycles, duplicate links, missing adjacency lists, very large graphs, parallel processing, deterministic ordering, fetch failures, backpressure, and per-host rate limits.

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