Online Assessment
Questions: There were 4 questions in total. All four of the questions can be found here.
Problem Solving Round
Questions: Given a start node and an end node, how can we determine the shortest path from the start to the end while avoiding certain nodes within a 'k' distance radius of designated 'thief' nodes? These thief nodes impose a constraint, as any path within 'k' distance from their current position should be avoided.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Coding Round
Questions: Design a car reservation system to efficiently allocate a list of n cars to maximize the number of customers served. The solution should focus on optimizing resource utilization and ensuring that as many customer requests as possible are fulfilled.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Hiring Manager Round
Questions:
- Are you a heart or a head type of person?
- Why would you like to join Uber?
- Questions about leadership positions that I had mentioned in my resume.
- How did you handle teammates who were not taking their work seriously? Explained with examples.
- Career aspirations.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.