AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Uber
Compare
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
Uber SDE-2 Interview Questions, Process, and Tips
Top Uber SDE-2 Interview Questions and Answers
- Q1. Smallest Subarray with K Distinct Elements Problem Given an array A consisting of N integers, find the smallest subarray of A that contains exactly K distinct integers. ...read more
- Q2. Rat In a Maze Problem Statement Given a N * N maze with a rat placed at position MAZE[0][0] , find and print all possible paths for the rat to reach its destination at M ...read more
- Q3. Best Insert Position for a Target in a Sorted Array You are provided with a sorted array A of length N consisting of distinct integers and a target integer M . Your task ...read more
Uber SDE-2 Interview Experiences
2 interviews found
Anonymous
I was interviewed before Sep 2020.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
It was a telephonic interview at 10 in the morning. Interviewer seemed cool.
- Q1.
Best Insert Position for a Target in a Sorted Array
You are provided with a sorted array
Aof lengthNconsisting of distinct integers and a target integerM. Your task is to determine the position where... - Ans.
Find the best insert position for a target in a sorted array to maintain order.
Use binary search to find the correct position for the target integer in the sorted array.
If the target is already present in the array, return its index.
Maintain the sorted order of the array after inserting the target integer.
Handle edge cases like empty array or target being smaller than the first element or larger than the last element.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
The interview was in the morning at 10 AM in the office meeting room.
- Q1.
House Robber Problem Statement
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...
- Ans.
House Robber problem - find maximum amount of money Mr. X can rob without triggering alarm in circular street.
Use dynamic programming to keep track of maximum money robbed at each house.
Consider two cases - robbing the first house and not robbing the first house.
Handle circular arrangement by considering the first and last houses separately.
Return the maximum amount of money that can be robbed without triggering the al
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
The interview was at 11 AM in the meeting office.
- Q1.
Running Median Problem
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
Example:
Input:
N = 5
Stre... - Ans.
Calculate and print the median after each new integer is added to the stream.
Use a min heap to store the larger half of the numbers and a max heap to store the smaller half of the numbers.
Keep the two heaps balanced by ensuring the size difference is at most 1.
If the total number of elements is odd, the median is the top element of the larger heap. If even, it's the average of the tops of both heaps.
Round duration - 60 minutes
Round difficulty - Medium
The interview was at 1 AM.
Round duration - 60 minutes
Round difficulty - Easy
The meeting was at 2 PM in the office meeting room.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
10 AM
- Q1. Can you provide a deeper discussion about all the projects you completed in your previous company?
Interview Preparation Tips
Tip 1 : Be consistent in the preparation. Practice atleast one question everyday
Tip 2 : Make relevant notes that you can go through on the day before the interview
Tip 3 :Try to note your progress by giving timed contests
Tip 1 : Clearly mention the details of the projects that are relevant to the company that you are applying for
Tip 2 : Ensure that there are no grammatical mistakes and that you have highlighted the important keywords in your resume
Skills evaluated in this interview
I was interviewed before Sep 2020.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
Timing: evening
Environment: Online round took at home
- Q1.
Smallest Subarray with K Distinct Elements Problem
Given an array
Aconsisting ofNintegers, find the smallest subarray ofAthat contains exactlyKdistinct integers.Input:
The first line contains tw... - Ans.
Find the smallest subarray with exactly K distinct integers in an array.
Use a sliding window approach to keep track of the subarray with K distinct integers.
Use a hashmap to store the frequency of each integer in the current window.
Update the window size based on the number of distinct integers found.
Keep track of the smallest subarray meeting the criteria.
Return the starting and ending indices of the smallest subarray
Round duration - 90 minutes
Round difficulty - Medium
Machine coding round
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
- Q1.
Rat In a Maze Problem Statement
Given a
N * Nmaze with a rat placed at positionMAZE[0][0], find and print all possible paths for the rat to reach its destination atMAZE[N-1][N-1]. The rat is allowed to... - Ans.
The problem involves finding all possible paths for a rat to reach its destination in a maze.
Use backtracking to explore all possible paths in the maze.
Mark visited cells to avoid revisiting them.
Return the path once the destination is reached.
Handle edge cases like blocked cells and out-of-bounds movements.
Round duration - 60-90 minutes
Round difficulty - Medium
Round duration - 60 minutes
Round difficulty - Medium
Hiring Manager round
Interview Preparation Tips
Tip 1 : Do some basic research about the interview process and types of rounds while appearing for a company interview. Narrow down the topics and draft a realistic plan afterwards.
Tip 2 : Try to solve as many problems as possible as this is primarily what you will be doing in live interview rounds.
Tip 1 : Tailor your resume as per expectations from the role you are applying for.
Tip 2 : Order your experiences and skills by relevance.
Tip 3 : Try to fit the content in a single page.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I was interviewed before May 2021.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Easy
- Q1.
Balanced Parentheses Combinations
Given an integer
Nrepresenting the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.Explanati...
- Ans.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Terminate recursion when the number of open and close parentheses used equals the given number of pairs.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Easy
- Q1.
Boundary Traversal of Binary Tree Problem Statement
You are given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in an anti-clockwise direction starting from the ro...
- Ans.
Print the boundary nodes of a binary tree in an anti-clockwise direction starting from the root node.
Traverse the left boundary nodes from top to bottom
Traverse the leaf nodes from left to right
Traverse the right boundary nodes from bottom to top
Handle cases where nodes are null (-1)
Print the boundary nodes in the specified order
(1 Question)
Round duration - 45 Minutes
Round difficulty - Easy
- Q1.
Bottom View of Binary Tree Problem Statement
Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...
- Ans.
The task is to print the bottom view of a binary tree from left to right.
Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.
For each horizontal distance, update the node value in a map to get the bottom view nodes.
Print the values of the map in sorted order of horizontal distance to get the bottom view sequence.
(1 Question)
Round duration - 45 minutes
Round difficulty - Easy
Bar raiser
- Q1. Can you design a parking lot using low-level design (LLD) and a tiny URL service using high-level design (HLD)?
- Ans.
Yes, I can design a parking lot using LLD and a tiny URL service using HLD.
For designing a parking lot using LLD, we can create classes like ParkingLot, ParkingSpot, Vehicle, etc. with their respective attributes and methods.
For designing a tiny URL service using HLD, we can focus on scalability, fault tolerance, and performance. We can use techniques like sharding, caching, load balancing, etc.
In the parking lot LLD, ...
Interview Preparation Tips
Tip 1 : Prepare 1-2 examples for each Leadership Principles
Tip 2 : Prepare questions from the latest interview experiences
Tip 1 : Concise, without errors
Tip 2 : Highlight years of experience
Skills evaluated in this interview
I applied via Recruitment Consulltant and was interviewed before Apr 2021. There were 2 interview rounds.
2 coding questions
(1 Question)
- Q1. Ds algo round 2 medium questions
Interview Preparation Tips
Interview Questionnaire
10 Questions
- Q1. Find sum of all numbers that are formed from root to leaf path (code) expected time complexity O(n)
- Ans.
Find sum of all numbers formed from root to leaf path in a binary tree
Traverse the binary tree using DFS
At each leaf node, add the number formed from root to leaf path to a sum variable
Return the sum variable
Time complexity: O(n)
Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25
- Q2. Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC -> A BC, AB C, ABC, A B C
- Ans.
Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.
Use recursion to generate all possible combinations of spaces
For each recursive call, either add a space or don't add a space between the current character and the next character
Base case is when there are no more characters left to add spaces between
Time complexity is O(2^n) where n is the length of the string
- Q3. Preorder traversal without using recursion
- Ans.
Preorder traversal without recursion
Use a stack to keep track of nodes
Push right child first and then left child onto stack
Pop top of stack and print value
Repeat until stack is empty
- Q4. There is a 12 km road and a contractor who is in-charge of repairing it. Contractor updates you about the work which is done in patches. Like “Road between 3.2 km to 7.9 km repaired ”, “Road between 1.21 k...
- Ans.
Find longest continuous patch on a 12 km road with updates in patches
Maintain a variable to keep track of current patch length
Update the variable whenever a new patch is added
Maintain a variable to keep track of longest patch so far
Compare current patch length with longest patch length and update if necessary
Use a sorted data structure like a binary search tree to store the patches for efficient search
Time complexity: ...
- Q5. Several Questions were asked from my project
- Q6. Find median of an unsorted array. (code
- Ans.
Find median of an unsorted array.
Sort the array and find the middle element
Use quickselect algorithm to find the median in O(n) time
If the array is small, use brute force to find the median
- Q7. General discussion on heaps
- Q8. A stream of characters is coming, at any moment you have to tell ‘k’ elements closest to a given number (code)
- Ans.
Find 'k' elements closest to a given number from a stream of characters.
Use a priority queue to keep track of closest elements.
Update the queue as new characters come in.
Return the 'k' closest elements from the queue.
- Q9. Design data structure that supports insert(), remove(), find-max(), delete-max() operations. All operations should run in O(1) time. Lots of discussion was there, discussed many approaches.
- Ans.
Design a data structure with O(1) insert, remove, find-max, and delete-max operations.
Use a doubly linked list to maintain the elements in sorted order.
Use a hash table to store the pointers to the nodes in the linked list.
Maintain a pointer to the maximum element in the hash table.
Update the pointers in the hash table when inserting or removing elements.
Update the maximum pointer when deleting or inserting the maximum
- Q10. Check whether given link list represents palindrome
- Ans.
Check if a given linked list is a palindrome.
Traverse the linked list and store the values in an array.
Compare the first and last elements of the array, then move towards the center.
If all elements match, the linked list is a palindrome.
Alternatively, use two pointers to find the middle of the linked list and reverse the second half.
Compare the first half with the reversed second half to check for a palindrome.
Interview Preparation Tips
Experience: Recently I attended Amazon Bangalore interview for SDE 2 position. All f2f and no phone/written screening as I had attended one before and cleared those. Total 4 rounds wer der. The first techh round dey asked mi questions listed above.
Tips: NA
Round: Technical Interview
Experience: ROUND 2 dey asked mi above questions
Tips: NA
Round: Technical Interview
Experience: Round 3 Above questions wer asked.
Round: Technical Interview
Experience: This was the last round. thy asked mi above questions
College Name: NA
Skills evaluated in this interview
I was interviewed in May 2022.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
Timing was around 11 am
Environment was great, it intrigued me to join Blinkit.
- Q1.
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
... - Ans.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Sort the array in non-decreasing order.
Use two pointers approach to find pairs with sum equal to 'S'.
Return pairs in sorted order based on first value, with smaller second value coming first.
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
Timing 11 am
Interviewer had good knowledge
- Q1. Can you explain the activity lifecycle in Android development?
- Ans.
Activity lifecycle in Android development involves various states like onCreate, onStart, onResume, onPause, onStop, onDestroy.
Activity is created with onCreate() method
Activity becomes visible with onStart() and onResume() methods
Activity goes into background with onPause() method
Activity is stopped with onStop() method
Activity is destroyed with onDestroy() method
- Q2. Can you explain the fragment lifecycle in Android development?
- Ans.
Fragment lifecycle in Android involves various states like created, started, resumed, paused, stopped, and destroyed.
Fragments are created using the onCreateView() method.
Fragments go through states like created, started, resumed, paused, stopped, and destroyed based on user interactions and system events.
Fragment lifecycle methods include onCreate(), onStart(), onResume(), onPause(), onStop(), and onDestroy().
- Q3. Can you explain the MVVM pattern?
- Ans.
MVVM is a design pattern that separates the user interface from the business logic and data model.
MVVM stands for Model-View-ViewModel
Model represents the data and business logic
View represents the UI components
ViewModel acts as an intermediary between the Model and View, handling user input and updating the Model
MVVM promotes separation of concerns and easier unit testing
Round duration - 30 Minutes
Round difficulty - Easy
This round is cultural fit round
Interview Preparation Tips
Tip 1 : Prepare easy/medium level data structures questions in leetcode. Solve atleast 50 questions of multiple types like strings, arrays, tree, linked list, graph
Tip 2 : Go through Android basic questions like lifecycle, live data, MVC/mvp/ mvvm pattern, retrofit, data binding
Tip 3 : Atleast solve 5 design questions like how to build Instagram, analytics library, crashlytics
Tip 1 : be concise
Tip 2 : write only those keywords which you have in depth knowledge
Skills evaluated in this interview
I was interviewed in May 2022.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
Anytime
- Q1.
Problem: Sort an Array of 0s, 1s, and 2s
Given an array/list
ARRconsisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.Input:
The input sta...
- Ans.
The task is to sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to partition the array into three sections: 0s, 1s, and 2s.
Initialize three pointers: low, mid, and high. low points to the start of the array, mid points to the current element being processed, and high points to the end of the array.
While mid <= high, if ARR[mid] is 0, swap ARR[low] and ARR[mid], increment low and mid. If
- Q2.
Connect Ropes with Minimum Cost
Given 'N' ropes, each having different lengths, your task is to connect these ropes into one single rope. The cost to connect two particular ropes is equal to the sum of th...
- Ans.
The task is to connect N ropes into one rope with minimum cost.
Sort the array of rope lengths in ascending order.
Initialize a variable to keep track of the total cost.
While there are more than one rope, take the two shortest ropes and connect them.
Add the cost of connecting the two ropes to the total cost.
Replace the two shortest ropes with the connected rope.
Repeat the above steps until only one rope remains.
Return th
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
- Q1.
Maximum Subarray Sum Problem Statement
Given an array
ARRconsisting ofNintegers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.Example of Sub...
- Ans.
The task is to find the maximum possible sum of a non-empty subarray of an array.
Iterate through the array and keep track of the maximum sum encountered so far
If the current element is greater than the sum so far, start a new subarray
If the current element plus the sum so far is greater than the maximum sum, update the maximum sum
Return the maximum sum
- Q2.
Diameter of a Binary Tree Problem Statement
Given a binary tree, return the length of its diameter. The diameter of a binary tree is defined as the length of the longest path between any two nodes in the ...
- Ans.
The diameter of a binary tree is the length of the longest path between any two end nodes in the tree.
The diameter of a binary tree can be calculated by finding the maximum of the following three values: 1) the diameter of the left subtree, 2) the diameter of the right subtree, and 3) the longest path that passes through the root node.
To find the diameter of a binary tree, we can use a recursive approach where we calcu...
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
This round was more aroung sytem design and my past work experience.
- Q1. Can you describe the system design for a platform like BookMyShow and the questions that were raised during the discussion?
- Ans.
Design a bookmyshow system
Design a system to book and manage movie tickets
Consider features like seat selection, payment, and ticket cancellation
Include user authentication and authorization
Implement a database to store movie and theater information
Consider scalability and performance of the system
(1 Question)
Round duration - 30 Minutes
Round difficulty - Easy
This is non-tech round.They just want to check your nature ,attitude and team work skills.
- Q1. Why do you want to leave your current job and what are your thoughts on the CTC being offered?
- Ans.
I want to leave my current job for better growth opportunities and a more challenging role.
Seeking new challenges and opportunities for professional growth
Looking for a role that aligns better with my skills and interests
Desire to work in a more dynamic and innovative environment
Seeking better compensation and benefits
Wanting to expand my knowledge and skills in a different domain
Interview Preparation Tips
Tip 1 : Pratice DSA and focus on the core subject like Database and OS
Tip 2 : Practice atlest 2 question everday to maintain consistency.
Tip 1 : Crisp Resume : Every body knows about this step, you must create a crisp resume mentioning about your key skills, always add impact numbers if possible (for example : increased efficiency by 50%, reduced cost by 2X, etc.) Add keywords around your skills, highlight them using BOLD in resume.
Tip 2 : Use Linkedin : Send connections requests directly to the recruiters rather than asking for referrals.
Skills evaluated in this interview
I was interviewed in May 2021.
Round duration - 120 minutes
Round difficulty - Medium
it was morning 10AM-12
friendly environment given by the interviewer
It was machine coding round, the problem statement was to create a online food ordering system with various features.
interviewer was good and supportive
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
timing noon 3-4Pm
good interviewer
interviwer was giving hints if required and all
- Q1.
Problem: Sort an Array of 0s, 1s, and 2s
Given an array/list
ARRconsisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.Input:
The input sta...
- Ans.
Sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to sort the array in a single pass.
Initialize three pointers for 0, 1, and 2 values and iterate through the array.
Swap elements based on the values encountered to achieve the sorted array.
Example: Input array [0, 2, 1, 1] should be sorted as [0, 1, 1, 2].
- Q2.
Maximum Path Sum Problem Statement
You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.
Example:
Input:
For the giv...
- Ans.
Find the maximum sum of the path from the root to any leaf node in an n-ary tree.
Traverse the tree from root to leaf nodes, keeping track of the sum along the path.
At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.
Consider using depth-first search (DFS) to traverse the tree efficiently.
Handle cases where nodes are absent (-1) by appropriately updating the pat...
(1 Question)
Round duration - 90 Minutes
Round difficulty - Easy
evening 4-5:30PM
interviewer was good
very supportive and giving hints
- Q1. Design a system for BookMyShow to allow users to book movie tickets.
- Ans.
Design a system for BookMyShow to allow users to book movie tickets.
Create a user-friendly website and mobile app for users to browse movies and showtimes.
Implement a secure payment gateway for users to purchase tickets online.
Develop a database to store movie information, showtimes, and user bookings.
Include features like seat selection, ticket confirmation, and booking history for users.
Integrate with cinema partners
(2 Questions)
Round duration - 40 Minutes
Round difficulty - Easy
4-5 PM
Interviewer was good
- Q1. Why should we hire you?
- Q2. Why are you considering a switch in your job?
Interview Preparation Tips
Tip 1 : Practice Atleast 200 Questions
Tip 2 : Practice company specific interview question
Tip 3 : Prepare resume nicely
Tip 1 : Prepare resume very nicely.
Tip 2 : don't mention any tech stack you are confident of.
Skills evaluated in this interview
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
That is machine coding round, where one problem will be given and you have to implement proper functionality with correct test cases.
I applied via Referral and was interviewed in Jan 2023. There were 3 interview rounds.
This was a machine coding round in which we have to implement an online cab booking service.
Standard problem solving round consists of two questions on tree and dp.
Interview Preparation Tips
Recently Viewed
JOBS
Amazon
No Jobs
JOBS
Browse jobs
Discover jobs you love
REVIEWS
Uber
No Reviews
JOBS
Intel
No Jobs
JOBS
Bosch
No Jobs
JOBS
Bosch
No Jobs
JOBS
Uber
No Jobs
REVIEWS
Uber
No Reviews
REVIEWS
Uber
No Reviews
LIST OF COMPANIES
Uber
Overview
Tell us how to improve this page.
Uber Interviews By Designations
- Uber Software Engineer Interview Questions
- Uber Software Developer Interview Questions
- Uber Data Analyst Interview Questions
- Uber Senior Software Engineer Interview Questions
- Uber Business Analyst Interview Questions
- Uber Product Manager Interview Questions
- Uber Operations Manager Interview Questions
- Uber Software Developer Intern Interview Questions
- Show more
Interview Questions for Popular Designations
SDE-2 Interview Questions from Similar Companies
Fast track your campus placements
|
Driver
584
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
CAR Driver
361
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Engineer
157
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Operations Executive
136
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Data Analyst
130
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Ola Cabs
Airbnb
- Home >
- Interviews >
- Uber Interview Questions >
- Uber SDE-2 Interview Questions
