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

# SDE - 2

Uber
6 rounds | 7 Coding problems

## Interview preparation journey

Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, Graphs, Dynamic programming, Trees, stack, queue, System Design
Tip

Tip 1 : Be consistent in the preparation. Practice atleast one question everyday
Tip 2 : Make relevant notes that you can go through on the day before the interview
Tip 3 :Try to note your progress by giving timed contests

Application process
Eligibility: No
Resume tip

Tip 1 : Clearly mention the details of the projects that are relevant to the company that you are applying for
Tip 2 : Ensure that there are no grammatical mistakes and that you have highlighted the important keywords in your resume

## Interview rounds

01
Round
Medium
Telephonic
Duration60 minutes
Interview date8 Feb 2020
Coding problem1

It was a telephonic interview at 10 in the morning. Interviewer seemed cool.

### 1. Algorithm to find best insert position in sorted array

Easy
10m average time
85% success
0/40

#### You are given a sorted array 'arr' of distinct values and a target value 'm'. You need to search for the index of the target value in the array.

##### Note:...
View more
02
Round
Medium
Face to Face
Duration60 minutes
Interview date24 Oct 2020
Coding problem2

The interview was in the morning at 10 AM in the office meeting room.

### 1. Frontend and Backend Tasks

Given 2 arrays - frontend and backend tasks . each number in these array represents the complexity needed to run the task.There is a server that has to run these tasks., the server is supposed to run one frontend and one backend task together only at a timeThe aim is to have lowest complexity server- (complexity of server needed = frontend task complexity + backend task complexity) such that al...

View more
Problem approach

Sort both arrays and start from one end of first and opposite end from second.and make pairs
I was trying to find the pairs as well as updating the max complexity needed but that approach was failing as it needed backtracking to correctly assign all the possible pairs.
The interviewer gave me a hint to solve it in parts-
First calculate the lowest complexity that the server can have(by...

View more

### 2. House robber

Moderate
15m average time
80% success
0/80

#### Mr. X is a professional robber planning to rob houses along a street. Each house has a certain amount of money hidden.

View more
Problem approach

Didn't get enough time to code the solution but explained the approach
We can do this using DP
We can maintain 2 arrays - one represents the ans if we start from first house and the other represents the answer if we start. from the second house.Then simply looping over the array and calculating these array's elements.

03
Round
Medium
Face to Face
Duration60 minutes
Interview date21 Oct 2020
Coding problem1

The interview was at 11 AM in the meeting office.

### 1. Running median

Hard
46m average time
50% success
0/120

#### You are given a stream of 'N' integers. For every 'i-th' integer added to the running list of integers, print the resulting median.

Problem approach

Started with the brute force solution of insertion sort
Gave the solution which uses two heaps - max heap and min heap. the difference in size of both heaps cannot be more than 1. And we might need to remove elements from one heap to other heap as more input numbers are added

04
Round
Medium
Face to Face
Duration60 minutes
Interview date21 Feb 2020
Coding problem1

The interview was at 1 AM.

### 1. System Design

Whenever someone liked our post or commented on our post

Problem approach

Tip 1: Asked a lot of questions to get clarity on the requirement
Tip 2: Keep in mind how to modularize the various components in the design
Tip 3: Mention the assumptions that you are taking

05
Round
Easy
Face to Face
Duration60 minutes
Interview date21 Oct 2020
Coding problem1

The meeting was at 2 PM in the office meeting room.

### 1. Resume and Past Experience Based Questions

There were a lot of questions, related to my resume, past experience, the technologies i had worked on. And then there were questions regarding the technologies and tech stack that they work on as the interviewer was trying to find whether my experience matches the requirements of the job
Questions related to frontend technologies like polymer, react.
Questions from C++ and databases were...

View more
Problem approach

Tip 1: Be truthful. Don't try to fake things you don't know about.

06
Round
Easy
Telephonic
Duration60 minutes
Interview date27 Feb 2020
Coding problem1

10 AM

### 1. Project Discussion

Deeper discussion about all the projects i did in the past company.

Problem approach

Tip 1: Know well about the projects that you have done in the past

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Minimum number of operands are required to use relational operators?

Start a Discussion
Similar interview experiences
SDE - 2
4 rounds | 5 problems
Interviewed by Uber
0 views
SDE - 2
2 rounds | 2 problems
Interviewed by Uber
1023 views
SDE - 2
3 rounds | 4 problems
Interviewed by Uber
848 views
SDE - 2
2 rounds | 2 problems
Interviewed by Uber
947 views
Companies with similar interview experiences
SDE - 2
5 rounds | 12 problems
Interviewed by Walmart
20411 views