Cracking the Robot Grid Distance Challenge: My Uber Software Engineer Interview

Uber | Software Engineer | Interview Experience

Interview Date: Not specified
Result: Not specified
Difficulty: Not specified

Interview Process

I had my phone interview with Uber for a Software Engineer role. The interview lasted about 30 minutes. The interviewer introduced himself and asked me about my background and experience. We discussed the Robot Grid Distance Challenge problem, which involved calculating the shortest distance a robot would have to travel on a grid to reach a destination while avoiding obstacles. I clarified some constraints with the interviewer before diving into the solution. I discussed my approach using BFS (Breadth-First Search) and how I would implement it in code.

After coding, the interviewer asked me to explain my thought process and potential edge cases I had not considered. We also went through the time complexity and space complexity of my solution, which was O(n*m), where n is the number of rows and m is the number of columns in the grid. Overall, it was a positive experience, and the interviewer was very supportive and provided valuable feedback throughout the conversation.

Technical Questions

  1. Robot Grid Distance Challenge (BFS, Grid)

Tips & Insights

  • Clarify constraints before diving into the solution.
  • Be prepared to discuss edge cases and the complexities of your solution.