Uber | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview started with basic introductions. I was then asked to solve a problem related to robot movements on a grid. The challenge involved calculating the distance a robot would travel to navigate from a starting point to a target position on a grid with obstacles. After discussing my initial approach, I implemented a BFS algorithm to efficiently find the shortest path. The interviewer asked clarifying questions to ensure I understood the problem constraints and requirements. I received hints to refine my solution, leading to a successful implementation. The session concluded with a debrief where the interviewer provided feedback on my coding style and problem-solving approach.
Technical Questions
- Robot Grid Distance Challenge (BFS, Graph Traversal)
Tips & Insights
- Be prepared to explain your thought process clearly.
- Practice BFS and other graph traversal algorithms to gain confidence.