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

SDE - 1

Uber
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I participated in a college placement drive and put forth my best effort. Unfortunately, I only made it through the initial round. Perhaps I should have practiced more. Nevertheless, this experience provided a valuable opportunity for me to assess my standing and learn from it.
Application story
I applied for a placement drive designed for my 10th-semester internship, and our college made sure to prepare us for it.
Why selected/rejected for the role?
I was not chosen for this role; perhaps I should have put in more effort. I only made it to the first round and didn't progress any further.
Preparation
Duration: 3 months
Topics: Data structures, Algorithm, OOPS, pointers
Tip
Tip

Regularly engage in competitive programming practice.
Explore the experiences of individuals who have gone through interviews.
Seek advice and insights from senior employees working in that particular organization

Application process
Where: Campus
Eligibility: no
Resume Tip
Resume tip

Tip 1: Seek a professional review for your work.
Tip 2: Include only the information you are knowledgeable about.

Interview rounds

01
Round
Easy
Video Call
Duration90 mins
Interview date12 Jan 2023
Coding problem2

This round was conducted on a coding platform in the afternoon. It comprised 12 questions, out of which 10 were multiple choice while 2 were coding questions. It was of medium level, you can easily crack it if you have basic knowledge of Linux and programming.

1. Longest Common Subsequence

Moderate
0/80
Asked in companies
ShareChatSquadstackTata Consultancy Services (TCS)

You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

A String ‘a’ is a subsequence of a String ‘b’ if ‘a’ can be obtained from ‘b’ by deletion of several (possibly, zero or all) characters. A common subsequence of two Strings is a subsequence that is common to both Strings.

Problem approach

Step 1: Upon reading the problem, I recognized it as a fundamental dynamic programming problem.
Step 2: I created a 2D array called dp and utilized loops to populate it with the necessary values.
Step 3: The function returns the value at the dp array's bottom-right index.

Try solving now

2. Rearrange Linked List

Moderate
22m average time
80% success
0/80
Asked in companies
UberGoldman SachsGroww

You have been given a singly Linked List in the form of 'L1' -> 'L2' -> 'L3' -> ... 'Ln'. Your task is to rearrange the nodes of this list to make it in the form of 'L1' -> 'Ln' -> 'L2' -> 'Ln-1' and so on. You are not allowed to alter the data of the nodes of the given linked list.

For example:
If the given linked list is 1 -> 2 -> 3 -> 4 -> 5 -> NULL.

Then rearrange it into 1 -> 5 -> 2 -> 4 -> 3 -> NULL. 
Problem approach

Step 1: Begin traversing the linked list starting from the head node.
Step 2: Remove nodes at odd indexes, which means deleting every node occurring at index 1, 3, 5, and so on, while storing them separately in a new linked list.
Step 3: We now have two linked lists: one containing nodes with even indexes (head1) and the other containing nodes with odd indexes (head2).
Step 4: Locate the tail of head1 and set its "next" pointer to head2.
Step 5: The two linked lists are now merged, and we can return them as the output.

Try solving now
02
Round
Medium
Video Call
Duration60 mins
Interview date15 Feb 2020
Coding problem2

1. Deletion In Doubly Linked List

Easy
15m average time
90% success
0/40
Asked in companies
FlipkartTata Consultancy Services (TCS)Zomato

You are given a Doubly Linked List of ‘N’ positive integers. Your task is to delete a node at position ‘POS’ in the linked list.

Note:
Assume that the Indexing for the linked list starts from 0.
EXAMPLE:
Input: ‘N’ = 5, 'LIST' = [1, 1, 2, 3, 4, -1], ‘POS’ = 1.

Output: 1 < - > 2 < - > 3 < - > 4 

Here in the given list, we can see that the node at position 1 is deleted.
Problem approach

This problem required the concept of a self-balancing tree.

Try solving now

2. SQL question

Compose a query to retrieve the student with the second-highest marks from the table.

Problem approach

Employ the fundamental approach by first identifying the highest marks and then utilizing a nested query to locate the second-highest marks that are not equal to the highest. This method will yield the second-highest marks.

For further understanding, consider watching SQL tutorials on Gate Smashers videos.

03
Round
Easy
Video Call
Duration60 mins
Interview date19 Feb 2020
Coding problem1

Describe your projects, including the use case, tech stack, and your contributions to each project.

Besides academics, what activities have you engaged in during college? (TPC and SCOPE courses mentioned)

Could you explain why your Final year project isn't listed on your resume?

Subsequently, he inquired about Inheritance and its feasibility in Python.

Outline the disparities between HTML and HTML5.

Define TypeScript.

Enumerate various data types in JavaScript.

1. System Design Question

Develop a scalable online food delivery system akin to Uber Eats or DoorDash platforms. The system must facilitate user interactions such as restaurant browsing, order placement, delivery tracking, and payment processing. Consider crucial elements, including user interfaces, database design, order management, and delivery logistics.

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
SDE - 1
1 rounds | 3 problems
Interviewed by Uber
0 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Uber
968 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by Uber
716 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Uber
666 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
107832 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
52130 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
32261 views
6 comments
0 upvotes