Uber | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview consisted of a single technical round focused on problem-solving and algorithm design. The candidate was presented with a coding challenge related to pathfinding on a grid, which involved discussing potential solutions and optimizations.
Technical Questions
- Robot Grid Distance Challenge (Pathfinding, Graph Traversal)
You are given an NxN grid with various obstacles. Your goal is to find the minimum path distance from the top-left corner (0,0) to the bottom-right corner (N-1,N-1). Obstacles block the path, and you can only move right or down.
Example Input:[[0,0,0],[0,1,0],[0,0,0]]
Example Output:4
Candidates were expected to discuss edge cases, such as when there is no path to the target, and to optimize their approach for larger grid sizes.
Tips & Insights
Focus on understanding the problem thoroughly before jumping into coding. Discuss your thought process clearly and consider edge cases during your explanation.