Ramp·Software Engineer·Technical Phone Screen
- Given a starting URL for a web-based maze where each URL is a room, write a function that performs BFS or DFS over HTTP requests to find whether any reachable room is an exit. Return the exit URL or None if no exit exists. You must handle cycles.
- Extend your maze-solving function to handle 503 responses with limited retries, and 401 responses by capturing authorization keys from successful room responses and forwarding them in subsequent requests.
“The cycle-handling part I got immediately, just a visited set on URLs.”