Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Uber interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Uber
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 5 Months
Topics: Algorithms, C++, Aptitude and Reasoning, Operating System, Java, DBMS, Data Structure and Computer Networks.
Tip
Tip

Tip 1 : The most important thing is to prepare Data Structures and Algorithms. Ensure to be very much clear on your basics and skills.
Tip 2 : Practice a minimum of 100 DSA questions. Practice aptitude and reasoning questions regularly.

Application process
Where: Linkedin
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Make a one page resume. 
Tip 2 : Add links to show originality of your projects.
Tip 3 : Do not add false information just to fill the resume.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration90 Minutes
Interview date17 Sep 2021
Coding problem2

Sum Between Zeroes
You are given a Singly Linked List which contains a series of integers separated by ‘0’.
Between two zeroes, you have to merge all the nodes lying between them into a single node which contains the sum of all the merged nodes. You have to perform this in place.

1. MCQ Questions

MCQ Round 1Topics:- Maths(Probability, a little Trigonometry), Puzzles. This round was a little tough as the time required to solve these question was a lot.

MCQ Round 2 Topics - Computer fundamentals (OOPS, Algorithm, Data Structure, Operating System, Computer Networks, DBMS)

Number Of MCQs - 20

2. Sum Between Zeroes

Easy
20m average time
80% success
0/40
Asked in companies
MicrosoftAmazonUber

You are given a Singly Linked List which contains a series of integers separated by ‘0’.

Between two zeroes, you have to...

View more
Try solving now
02
Round
Easy
Video Call
Duration60 Minutes
Interview date29 Sep 2021
Coding problem1

This was the last round of evaluation. The interview started with some questions related to the projects mentioned in my CV. After around 30 minutes, a coding question based on Graph Data Structure was asked (It was related to Topological sorting). I was asked to explain the idea and approach to the problem and not to code. At last, a few HR questions were also asked in the same round.

1. Loot Houses

Moderate
26m average time
0/80
Asked in companies
AmazonQuikrOYO

A thief wants to loot houses. He knows the amount of money in each house. He cannot loot two consecutive houses. Find the maximum amount of money he can loot.

Problem approach

The first line of input contains a single integer 'N' denoting the total number of houses.

The second line of input contains 'N' single space-separated integers, denoting the amount of money in every 'i-th' house.

The only line of output will print the maximum amount of loot that is possible.

You don’t need to print anything, it has already been taken care of. Just implemen...

View more
Try solving now

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
company logo
Software Engineer
2 rounds | 3 problems
Interviewed by Uber
704 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 2 problems
Interviewed by Uber
976 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 2 problems
Interviewed by Uber
1061 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Uber
748 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
9911 views
7 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
6267 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
7029 views
1 comments
0 upvotes