You are given an API that returns the next location you should visit in a maze. Starting from an initial location, repeatedly call the API until you reach the destination. Design the client logic, termination conditions, error handling, and tests for this API-driven maze traversal. ### Constraints & Assumptions - The API is real, not mocked, in the interview setting. - The API returns enough information to identify the next address or state. - The traversal may involve network failures. - The destination condition is detectable from the response. ### Clarifying Questions to Ask - What does the API response schema look like? - Can the API return cycles? - Is there a maximum number of calls? - How should authentication and rate limits be handled? - Should the client return the path or only the final destination? ### What a Strong Answer Covers ```premium-lock What a Strong Answer Covers ``` ### Follow-up Questions - How would you handle paginated or batched next steps? - How would you make traversal resumable? - How would you observe latency and failure rate? - How would concurrency help or hurt if multiple paths were possible?