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

This was a technical phone screen with Uber for a Software Engineer position. The interviewer was very friendly and tried to make the conversation comfortable. I was asked to solve problems related to algorithms and data structures, specifically focusing on robot grid distance challenges.

Technical Questions

  1. Robot Grid Distance Challenge (BFS, Shortest Path)
    You have a grid representing a field where a robot can move. Find the shortest distance it can travel from the top-left corner to the bottom-right corner, given that some obstacles are in its way.

Tips & Insights

We discussed several approaches, and I was able to come up with a BFS solution. The interviewer provided hints to optimize the solution further, which was a good learning experience. Additionally, there was a behavioral section where I was asked about my previous projects and how I worked within a team. Overall, I think it went well, but I’m waiting to hear back on the outcome.