Uber
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Company Website and was interviewed in May 2023. There were 3 interview rounds.
Very Easy questions just do it
SDE 1 is an entry-level position where candidates gain foundational skills before advancing to SDE 2.
SDE 1 focuses on learning and building foundational skills in software development.
SDE 2 requires more experience and expertise in software development.
Advancing from SDE 1 to SDE 2 is a common career progression in tech companies.
SDE 1 roles often involve working on smaller projects or components of larger projects.
SDE...
No, I believe in standing up against bullying and supporting those who are being bullied.
I do not support bullying in any form and believe in treating others with respect and kindness.
I would try to intervene and help the person being bullied, either by talking to the bully or seeking help from a teacher or supervisor.
I believe in creating a positive and inclusive environment where everyone feels safe and respected.
Top trending discussions
I applied via Referral and was interviewed in Jul 2024. There was 1 interview round.
Hackerrank - 3 questions 2 hrs
I applied via Recruitment Consulltant and was interviewed in Oct 2024. There was 1 interview round.
Asked 2 questions on JS.
1)Publish subscribe system
2) Make toastify component
I applied via Referral and was interviewed in Jan 2024. There were 2 interview rounds.
Hackerrank test with medium questions
I applied via Referral and was interviewed before Feb 2022. There were 2 interview rounds.
I applied via Referral and was interviewed before Jul 2023. There were 3 interview rounds.
Design splitwise. Low Level question. More like Machine Coding
Question on Strings and DP
I applied via Referral and was interviewed in Apr 2021. There were 4 interview rounds.
2 variable variation of LIS
The problem involves finding the longest increasing subsequence in two arrays
Dynamic programming can be used to solve the problem
The time complexity of the solution is O(n^2)
Example: Given two arrays [1, 3, 5, 4] and [2, 4, 3, 5], the longest increasing subsequence is [3, 5]
Example: Given two arrays [10, 22, 9, 33, 21, 50, 41, 60] and [5, 24, 39, 60, 15, 28, 27, 40], the longest increasing su
Search for an element in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Compare the target element with the first element of the array to determine which half to search.
Perform binary search on the selected half to find the target element.
Time complexity: O(log n), Space complexity: O(1).
Find the first non-repeating character in a continuous character stream.
Use a hash table to keep track of character frequency.
Iterate through the stream and check if the current character has a frequency of 1.
If yes, return the character as the first non-repeating character.
If no non-repeating character is found, return null or a default value.
I applied via Campus Placement and was interviewed in Jul 2022. There was 1 interview round.
Given a node in a family tree, print all nodes on the same level.
Traverse the tree level by level using BFS
Keep track of the level of each node while traversing
Print all nodes with the same level as the given node
Example: If the given node is 'John', print all his siblings and cousins
I applied via LinkedIn and was interviewed in Jul 2022. There were 2 interview rounds.
Prepare from hackerrank array and trees problems
based on 1 interview
Interview experience
Driver
567
salaries
| ₹0.9 L/yr - ₹7.2 L/yr |
CAR Driver
357
salaries
| ₹0.8 L/yr - ₹5.1 L/yr |
Software Engineer
142
salaries
| ₹23 L/yr - ₹100 L/yr |
Data Analyst
142
salaries
| ₹5.4 L/yr - ₹23.3 L/yr |
Senior Software Engineer
138
salaries
| ₹35 L/yr - ₹110 L/yr |
Amazon
Ola Cabs
Airbnb