Uber interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Uber
2 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Application process
Where: Campus
Eligibility: No criteria
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more
Interview rounds
01
Round
Hard
Video Call
Duration45 mins
Interview date14 Jul 2022
Coding problem1
1. Remove BST keys outside the given range
Easy
15m average time
85% success
0/40
Asked in companies
Given a Binary Search Tree (BST) and a range [min, max], remove all keys which are outside the given range. The modified tree should also be BST.
Problem approach
Given a Binary Search Tree (BST) and a range [min, max], remove all keys which are outside the given range. The modified tree should also be BST.
02
Round
Easy
Video Call
Duration45 mins
Interview date14 Jul 2022
Coding problem2
1. DBMS Questions
Tell the difference between SQL and NoSQL, when to use them. And have you used any of them in the previous projects.
Problem approach
Tip 1 : Understand the problem and think rationally taking into consideration the trade-offs that you would be making in choosing the one than the other.
Tip 2 : Always speak it out loud and make sure that you and the interviewer are on the same page.
Tip 3 : Always asked and clarify the requirements from the interviewer beforehand.
2. Minimum Cost Path
Moderate
25m average time
70% success
0/80
Asked in companies
You have been given a matrix of ‘N’ rows and ‘M’ columns filled up with integers. Find the minimum sum that can be obtained from a path which from cell (x,y) and ends at the top left corner (1,1).
From any cell in a row, we can move to the right, down or the down right diagonal cell. So from a particular cell (row, col), we can move to the following three cells:
Down: (row+1,col)
Right: (row, col+1)
Down right diagonal: (row+1, col+1)
Problem approach
You have been given a matrix of ‘N’ rows and ‘M’ columns filled up with integers. Find the minimum sum that can be obtained from a path which from cell (x,y) and ends at the top left corner (1,1).
From any cell in a row, we can move to the right, down or the down right diagonal cell. So from a particular cell (row, col), we can move to the following three cells:
Down: (row+1,col)
Right: (row, col+1)
Down right diagonal: (row+1, col+1)
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
1 rounds | 3 problems
Interviewed by Uber
Rejected
0 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Uber
Rejected
1368 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Uber
Rejected
929 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Uber
Selected 5238 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes