uber | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview involved a problem related to rider connections. The candidate was asked to determine the earliest time when all riders were connected based on a series of logs indicating that rider A shared a ride with rider B. The candidate suggested using Union-Find for the initial solution. However, a follow-up question raised the scenario where riders could block others, which Union-Find could not handle. The candidate then discussed an alternative approach using Breadth-First Search (BFS) and explained the thought process. The interviewer seemed satisfied with the explanation and then shifted to a more casual conversation.
Technical Questions
- Rider Connection Problem (Union-Find, Breadth-First Search, Graph)
Tips & Insights
Be prepared to adapt your solution when additional constraints are introduced, and be ready to explain your thought process clearly.