Cracking Uber’s Software Engineer Interview: The Challenging Robot Grid Distance Puzzle

Uber | Software Engineer | Interview Experience

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

Interview Process

The interview began with a brief introduction about the company and the team I might work with. I was then asked to explain my previous projects, with a focus on my problem-solving approaches. After discussing my background, we transitioned to the coding questions.

I was tasked with writing a function to calculate the minimum distance a robot would travel on a grid while avoiding certain obstacles. The interviewer encouraged the use of Depth-First Search (DFS) or Breadth-First Search (BFS) to solve the problem. Throughout the coding challenge, the interviewer was supportive and provided hints when I seemed stuck. After I explained my thought process and implemented the solution, we discussed potential optimizations.

The interview concluded with behavioral questions to assess my cultural fit within Uber. Overall, it was a constructive experience, although the time constraint added some pressure.

Technical Questions

  1. Robot Grid Distance Challenge (DFS, BFS, Graph)

Tips & Insights

Be prepared to discuss your previous projects in detail, especially your problem-solving strategies. Familiarize yourself with DFS and BFS algorithms, as they may be relevant to coding challenges.