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 | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, Aptitude , Programming Language.
Tip
Tip

Tip 1 : Clear basics
Tip 2 : Prepare well
Tip 3 : Do at-least 2 projects

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

Tip 1 : Write only those things in resume in which you are 100% confident
Tip 2 : Write maximum projects you have and be ready to explain them thoroughly

Interview rounds

01
Round
Easy
Online Coding Test
Duration120 minutes
Interview date20 Jun 2019
Coding problem1

It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium levels. Time was enough and no sectional time was present. 1-2 MCQs on SQL was also present.

1. Boolean Matrix

Moderate
35m average time
60% success
0/80
Asked in companies
OYOUberAmazon

Given a 2-dimensional boolean matrix mat of size N x M, modify the matrix such that if an element is 1, set its entire row and column to 1 i.e. if mat[i][j] = 1, then make...

View more
Problem approach

You need to make the modifications in the input matrix.
You do not need to print anything, it has already been taken care of.

Try solving now
02
Round
Easy
Video Call
Duration60 minutes
Interview date26 Jun 2019
Coding problem1

It was an online video interview round on HackerEarth with a simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class that required inheritance was asked by the interviewer to write. I was helped by the interviewer if I got stuck somewhere, Some questions on the implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.

1. Connect n ropes with minimum cost

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

You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connect the ropes with minimum cost.

Problem approach

Input format :
The first line of input contains an integer value 'N'. It denotes the total number of ropes.

The second line of input contains 'N' single space-separated integers representing the length of each rope i.e. a1, a2, a3, ... an.
Output Format :
The only line of output will contain an integer, the minimum cost for connecting all the ropes.

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
705 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 3 problems
Interviewed by Uber
1234 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
7030 views
1 comments
0 upvotes