Quick Summary
- Perform a Breadth-First Search (BFS) traversal of a URL graph starting from '/', processing nodes in discovery order.
- Simulate HTTP interactions by handling success (200), not-found (404), and transient failure (503/504) responses with specific retry rules.
- Track completed URLs to avoid reprocessing and terminate immediately upon receiving the 'Congrats' exit message.
What This Tests
- Breadth-First Search implementation and queue management.
- Graph modeling and traversal algorithms.
- State tracking using Sets and Maps for visited/completed nodes.
- Integrating retry/backoff logic into an iterative traversal loop.
Common Patterns
BFS / Graph Traversal
Hashing
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Stdout
-