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

Software Engineer

Uber
upvote
share-icon
3 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Journey
I've begun practicing coding questions on coding platforms, starting with the easier ones at the beginner level, and then progressing to some medium-level challenges. Additionally, I've familiarized myself with SQL and gained practical experience with AWS. During my coding practice, I explored various approaches to solving different coding problems.
Application story
I was contacted by HR through Naukri, and I found the entire process to be smooth and transparent. The initial step involved a written online test, followed by a technical interview. After that, there was a managerial round, and the final step was the HR round.
Why selected/rejected for the role?
Selected! my skills and previous experience were a perfect match for their requirements.
Preparation
Duration: 2 to 3 months
Topics: Data Structures, Python, AWS, SQL, Logical Reasoning
Tip
Tip

Tip 1: Engage in active hands-on practice on coding platforms to enhance your coding skills.
Tip 2: Ensure you practice all the skills mentioned in your resume regularly to maintain and improve your proficiency.
Tip 3: Stay informed and updated about the industry by reading articles and blogs related to your field.

Application process
Where: Naukri
Eligibility: Relevant experience as mentioned in the job description
Resume Tip
Resume tip

Tip 1: Regularly practice the skills listed on your resume to maintain and improve your proficiency.
Tip 2: Incorporate the tools used and specific activities you undertook during your tenure at a company into your resume to showcase your experience effectively.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration45 minutes
Interview date3 Jan 2023
Coding problem3

You had the flexibility to choose any time within 24 hours for the interview, which was convenient. The interview environment was comfortable, and overall, the interview difficulty level was moderate.

1. Pair Sum

Easy
15m average time
90% success
0/40
Asked in companies
GrofersOlaJP Morgan

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.

Note:

Each pair should be sorted i.e the first value should be less than or equals to the second value. 

Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Problem approach

In this approach, you can use a loop to iterate through the list and compare the value of each index with the target. Then, calculate the difference between the target and the current value and check if this difference exists in the original list. Here's a rephrased version:

"The method involves iterating through a loop and checking each element's value against the target. Next, the function calculates the difference between the target and the current element and determines whether this difference exists within the same list."

Try solving now

2. Merge Two Sorted Linked Lists

Moderate
15m average time
80% success
0/80
Asked in companies
AmazonCIS - Cyber InfrastructureUber

You are given two sorted linked lists. You have to merge them to produce a combined sorted linked list. You need to return the head of the final linked list.

Note:

The given linked lists may or may not be null.

For example:

If the first list is: 1 -> 4 -> 5 -> NULL and the second list is: 2 -> 3 -> 5 -> NULL

The final list would be: 1 -> 2 -> 3 -> 4 -> 5 -> 5 -> NULL
Problem approach

Use pointer and loops.

Try solving now

3. DBMS Question

Explain joins and types of joins with examples. (Learn)

Problem approach

Tip 1 : Explain join
Tip 2 : Write queries
Tip 3 : Explain with examples

02
Round
Medium
Video Call
Duration60 minutes
Interview date7 Feb 2023
Coding problem2

The interview took place at 5 pm. The environment was pleasant, and the interview difficulty level was moderate.

1. Valid Parentheses

Easy
10m average time
80% success
0/40
Asked in companies
OracleSwiggyAmerican Express

You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .


Return true if the given string 'S' is balanced, else return false.


For example:
'S' = "{}()".

There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.
Problem approach

To apply the stack approach, you can check if the stack is empty at the end of traversing a string. The idea is to use a stack data structure to keep track of opening symbols (e.g., parentheses, brackets, braces) encountered in the string. When you encounter a closing symbol, you can pop the corresponding opening symbol from the stack.

If the stack is empty at the end of the string traversal, it means that all opening symbols have their corresponding closing symbols, and the string is well-formed. Otherwise, if the stack is not empty, it indicates that there are unmatched opening symbols, and the string is not well-formed.

Here's a Python function that demonstrates this stack approach:

Python
Copy code
def is_well_formed(string):
stack = []
opening_symbols = "({[" # Define the opening symbols
closing_symbols = ")}]" # Define the corresponding closing symbols

for char in the string:
if char in opening_symbols:
stack.append(char)
elif char in closing_symbols:
if not stack or stack[-1] != opening_symbols[closing_symbols.index(char)]:
return False
stack.pop()

return len(stack) == 0

# Test cases
print(is_well_formed("()")) # Output: True
print(is_well_formed("()[]{}")) # Output: True
print(is_well_formed("([)]")) # Output: False
print(is_well_formed("{[()]}")) # Output: True
print(is_well_formed("{{[}}")) # Output: False
This function checks whether a given string is well-formed using the stack approach. It iterates through the characters of the input string and processes opening and closing symbols accordingly. In the end, it returns True if the stack is empty, indicating a well-formed string, and False otherwise.

Try solving now

2. Guess the output

a = [1,2,3];
b = a.pop([1,2]);
print(a);
print(b);
Problem approach

Tip 1: Practice logical questions
Tip 2: Practice programming language

03
Round
Medium
HR Round
Duration30 minutes
Interview date2 Feb 2023
Coding problem2

The timing wass late at night around 10 pm.

1. Basic HR Question

Tell me about yourself and your family.

Tell me about your previous experience.

Why do you want to change your job?

What do you expect from a company?

Why should we hire you?

What are your strengths and weaknesses?

Problem approach

Tip 1: Provide truthful answers during the interview.
Tip 2: Offer genuine reasons to share your perspective.
Tip 3: Be honest and display confidence without resorting to falsehoods.

2. Basic HR Question

What is your current CTC, and expected CTC? 

Problem approach

Tip 1: Shared current comp.
Tip 2: Expected comp.
Tip 3: Asked about the other perks and benefits of the company.

Here's your problem of the day

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

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
Software Engineer
2 rounds | 3 problems
Interviewed by Uber
929 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 3 problems
Interviewed by Uber
1562 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 2 problems
Interviewed by Uber
1198 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 2 problems
Interviewed by Uber
1288 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
11083 views
7 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7002 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
8503 views
1 comments
0 upvotes