Uber | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview started with a brief introduction of myself and my experiences. Then, the interviewer explained the structure of the interview and the problem statement: ‘Robot Grid Distance Challenge’. The first task was to calculate the minimum distance a robot would travel between two points in a grid. After understanding the task, I discussed my approach to solving it, considering techniques such as breadth-first search (BFS) and potential use of dynamic programming (DP). The interviewer prompted me to explain my reasoning for my chosen approach.
Once I wrote the initial pseudocode, the interviewer provided additional edge cases to consider. I quickly adjusted my code to address all scenarios. At the end of the interview, I discussed the time complexity of my solution, which the interviewer seemed satisfied with. Overall, I felt it went well, as I conveyed my thought process clearly.
Technical Questions
- Robot Grid Distance Challenge (BFS, Dynamic Programming)
Tips & Insights
- Clearly articulate your thought process during problem-solving.
- Be prepared to discuss edge cases and time complexity.