Uber Interview Questions, Process, and Tips

Q1. Tell me about yourself
Add your answer

Q1. Tell me about your education
Add your answer

Q1. Hr will simply ask something and yourself and that's it
Add your answer

Q1. Basic questions related to computer
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:30 PM.

Q1. Meeting
Ninja is organizing a meeting in an office that starts at a time ‘0’ and will end at a time ‘LAST’. There are ‘N’ presentations that are going to take place in that meeting whose start and end time...read more
Ans. Brute Force Approach
Algorithm:
 
• The idea here is to find the maximum sum subarray of size ‘K+1’, where the array will contain empty slots.
• First, we create an array named emptySlots[], to store the time duration in which there is no presentation.
• Run a loop to traverse all presentations, and in each iteration, add START[i] - END[i-1] (which gives a free slot between the ith presentation) into the array emptySlots[].
• N...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Total Unique Paths
You are present at point ‘A’ which is the top-left cell of an M X N matrix, your destination is point ‘B’, which is the bottom-right cell of the same matrix. Your task is to find the tot...read more
Ans. Recursive Approach
We can easily count the total number of paths by making a recursive algorithm.
 
The steps are as follows:
 
1. We are given a function UNIQUEPATHS(), which takes two integers ‘M’ and ‘N’ as parameters and returns a single integer. This will be the definition of our recursive function too.
2. As our base condition, we will check if our number of rows (‘M’) or a number of columns (‘N’) is equal to 1. If...read more
Answered by CodingNinjas
View 3 more amswers

Round duration - 90 minutes
Round difficulty - Medium

This round was coding round with discussion .
The interviewer tried to trick the questions and wanted to test how we respond if something is asked out of preparation.
The code we ran on Google Docs was checked on Online IDE if it ran for sample inputs.
Timing : 12:00 PM to 1:30 PM

Q1. Number of operations to make Graph connected
You have been given a graph consisting of ‘N’ vertices numbered from 1 to ‘N’. The graph has ‘M’ edges. In an operation, you can shift an edge between two direc...read more
Ans. Breadth First Search.
For a graph with ‘N’ vertices to be connected, there must be at least ‘N’ - 1 edges in the graph. If a graph has less than ‘N' - 1 edges it is impossible to make the graph connected. Otherwise, it is always possible to make graph connected. As we need to find the minimum number of operations to make the graph connected we will think greedily. We will find the total number of connected components in...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Snake and Ladder
You have been given a Snake and Ladder Board with 'N' rows and 'N' columns with the numbers written from 1 to (N*N) starting from the bottom left of the board, and alternat...read more
Ans. BFS
We will use Breadth-First Search to find the shortest path from cellNumber 1 to cellNumber N*N.
1. We will maintain a queue of cellNumber where the front of the queue will always contain a cell which can be reached by minimum dice throw from starting cell (cellNumber = 1).
2. Create a minDiceThrow array of size N*N initialise it with the maximum value (INT_MAX)
3. Start with pushing cellNumber 1 and updating minDiceThrow[1] = 0...read more
Answered by CodingNinjas
Add your answer

Round duration - 75 minutes
Round difficulty - Hard

This was a problem solving round and lasted for 75 minutes. The interviewer gave me a very complicated question.
The round was held on Google Meet and I was supposed to tell him the approach and write code on shared Google Docs.

Q1. XOR Query
Assume you initially have an empty array say ‘ARR’.
You need to return the updated array provided that some ‘Q’ number of queries were performed on this array.
The queries are of two types:
...read more
Ans. Brute Force
Approach:
• It is a brute force approach where we will create an empty array initially of size 10^5 + 1.
• Now, whenever we have a query of type 1 we will insert the value of VAL in the array. And when the query of type 2 comes then we will iterate through our array and perform an XOR operation with VAL to every value present in our array.
• Finally, we will return our array.
 
Algorithm:
• Create an array ans.
• Now it...read more
Answered by CodingNinjas
View 2 more amswers

The aptitude test here is mostly based on language proficiency. The test check the way you speak, how well you understand and how you respond to few basic situations. It is mostly on verbal reasoning. It doesn't mean you need to do practice on your verbal ability. It is just that they wanted how well you understand and listen to situations.

Q1. Telling about yourself
Ans. Speak confidently and clearly about yourself. Do focus too much on what are you speaking just focus on the way you speak and let it flow. Consider it as friendly gesture in professional manner🙂.
Answered by Sai Vamsi
Add your answer
Q2. Giving scenario related your role and ask your approach. Then they go with the work details, timings , can you handle and finally any questions you want to ask!
Ans. Scenario are simple and plain dont just focus on looking for best answer just focus on your speaking skills as even they asking these questions mostly to check how well you can speak thats all. Some say they even asked technical questions too regarding operating systems etc. But mostly they look for communication.
Answered by Sai Vamsi
Add your answer