Uber interview experience Real time questions & tips from candidates to crack your interview

SDE - 2

Uber
upvote
share-icon
4 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Data Structures, Low level design, System Design, Algorithms, Dynamic Programming, Machine coding (Coding skills around basic OOPs constructs).
Tip
Tip

Tip 1 : Practice top 50 data structure problems tagged with company as Uber. 
Tip 2 : Go through the past interview experiences on any online platform for the role for which you are applying.
Tip 3 : Understand system design basic concepts like Caching, load balancing, DB(SQL vs no-SQL) etc and practice common problems around the same.
Tip 4 : Dig dive into each and every detail around the project mentioned and the relevant tech stack used in you resume

Application process
Where: Referral
Eligibility: Minimum 3 years of relevant experience
Resume Tip
Resume tip

Tip 1 : Have some projects on resume. Dig dive into each and every detail around the project mentioned and the relevant tech stack used in you resume.
Tip 2 : Keep your resume brief and crisp, mention only high level and important details.
Tip 3 : Try to keep your resume limited to 1 single page.
Tip 4 : Try to highlight the tech stack that you used in your experience.
Tip 5 : Try to highlight the impacts with the help of some figures (like 98% performance improvement or 20% cost savings).

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date1 Jul 2021
Coding problem2

Timing - This was an Online screening test, where a candidate can attempt the test once anytime in a span of 2 weeks.
Environment - This was an Online screening test, and a tool used to conduct the interview.
Any other significant activity - There were 2 questions given that needed to be completed in 60 mins' time.
 

1. Car Pooling

Moderate
30m average time
70% success
0/80
Asked in companies
AmazonMathworksUber

You are working as a cab driver. Your car moves in a straight line and moves toward the forward direction only. Initially, you have ‘C’ empty seats for the passengers.

Now, you are given ‘N’ number of trips that you have to make. In each trip, you are given three integers ‘Num’, ‘pickPoint’, and ‘dropPoint’ denoting that there are ‘Num’ numbers of passengers standing at 'pickpoint’ and you have to drop them at 'droppoint’.

Your task is to find if it is possible to pick up and drop off all the passengers of all the given trips or not.

Note :
You have a special type of car containing any number of seats.
Problem approach

1. Finding the cab from the array which takes minimum time
2. Binary search to find minimum time required to complete n trips
3. In binary search while low < mid, compute number of trips to completed in mid minutes and if trips produced is less than n, set low to mid+1, else high to mid

Try solving now

2. Find the number of states

Moderate
15m average time
85% success
0/80
Asked in companies
WalmartUberIntuit

You are given ‘n’ cities, some of which are connected by bidirectional roads. You are also given an ‘n x n’ matrix i.e. ‘roads’, where if city ‘i’ and ‘j’ are connected by a road then ‘roads[i][j]'= 1, otherwise ‘roads[i][j]' = 0.


A province is a group of cities that are either directly or indirectly connected to each other through roads.


The goal is to count and return the total number of such provinces in the given matrix.


Example:
n = 4, roads = [ [1, 1, 1, 0],
                 [1, 1, 1, 0],
                 [1, 1, 1, 0],
                 [0, 0, 0, 1] ]

example

So, there are ‘2’ provinces.
Note:
1. A city is connected to itself. So, for every city ‘i’, ‘roads[i][i] = 1’.
Problem approach

Sort by first co-ordinate and then do merge interval, for the example after sort and merge we get
[ [-1, 5] ,[3, 6], [4,7] ]

1. To start put [-1, 5] in merge , count = 5- (-1) + 1 = 7
2. Next interval is a partial overlap : only take the new range which is [5,6] = 1, count = 8 , range is [-1, 6]
3. Note that if it a non-overlap interval take complete count as in step 1
4. Next interval is also partial overlap so take new/non-overlap interval which is [6,7] = 1 and hence answer is 9
Basically a slight modification of merge interval problem.

Try solving now
02
Round
Medium
Video Call
Duration90 minutes
Interview date8 Jul 2021
Coding problem1

Timing - 12:00 PM
Environment - It was a live coding round and hence I had to code it out in my local IDE.

1. Wildcard Pattern Matching

Hard
50m average time
30% success
0/120
Asked in companies
SalesforceFreshworksWalmart

Given a text and a wildcard pattern of size N and M respectively, implement a wildcard pattern matching algorithm that finds if the wildcard pattern is matched with the text. The matching should cover the entire text not partial text.

The wildcard pattern can include the characters ‘?’ and ‘*’

 ‘?’ – matches any single character 
 ‘*’ – Matches any sequence of characters(sequence can be of length 0 or more)
Try solving now
03
Round
Medium
Video Call
Duration60 minutes
Interview date8 Jul 2021
Coding problem1

1. Given a string, find the next smallest palindrome

Easy
12m average time
80% success
0/40
Asked in companies
UberAmazonMakeMyTrip

You are given a number 'N' in the form of a string 'S', your task is to find the smallest number strictly greater than the given number 'N' which is a palindrome.

Note:

1) A palindrome is a word, number, phrase, or another sequence of characters that reads the same backward as forward, such as 'naman', 'abcba', '1234321', etc
2) The numerical value of the given string 'S' will be greater than 0.
3) A single-digit number is also considered as a palindrome.
4) Note that the length of the string 'S' is nothing but the number of digits in the number 'N'.
Problem approach

Step 1 : Divide the number into 2 halves
Step 2 : Mirror the first half and apply its palindrome to the second half.
Step 3 : If the current number is greater than the original number, return this number.
Step 4 : Else, increment the first half and then mirror it and apply its palindrome to the second half.

Try solving now
04
Round
Hard
Video Call
Duration60 minutes
Interview date15 Jul 2021
Coding problem1

The timing was around 12:00 PM. The interviewer was kind and helping

1. System Design Question

Design a system to give live heatmap of concentration of Uber's drivers density across the world.

Problem approach

Tip 1 : Gather functional and non functional requirements thoroughly from the interviewer.
Tip 2 : Divide the globe into grids and try to determine the driver's location using this grid cell.
Tip 3 : Use a n-array tree structure to store the grids information with track of neighbouring grids as well.
Tip 4 : Talk about caching and dynamic location of driver.

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
company logo
SDE - 2
3 rounds | 5 problems
Interviewed by Uber
6080 views
0 comments
0 upvotes
company logo
SDE - 2
2 rounds | 2 problems
Interviewed by Uber
2259 views
0 comments
0 upvotes
company logo
SDE - 2
3 rounds | 4 problems
Interviewed by Uber
2389 views
0 comments
0 upvotes
company logo
SDE - 2
2 rounds | 2 problems
Interviewed by Uber
2556 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 2
5 rounds | 12 problems
Interviewed by Walmart
29892 views
8 comments
0 upvotes
company logo
SDE - 2
3 rounds | 5 problems
Interviewed by Amazon
6765 views
1 comments
0 upvotes
company logo
SDE - 2
6 rounds | 8 problems
Interviewed by Amazon
5280 views
0 comments
0 upvotes