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
Uber Software Developer Intern Interview Questions, Process, and Tips
Top Uber Software Developer Intern Interview Questions and Answers
- Q1. Minimum Operations to Connect a Graph You are given a graph with 'N' vertices labeled from 1 to 'N' and 'M' edges. In one operation, you can shift an edge from being bet ...read more
- Q2. XOR Query Problem Statement Assume you initially have an empty array called ARR . You are required to return the updated array after executing Q number of queries on thi ...read more
- Q3. Meeting Rescheduling Challenge Ninja is tasked with organizing a meeting in an office that starts at time ‘0’ and ends at time ‘LAST’. There are ‘N’ presentations schedu ...read more
Uber Software Developer Intern Interview Experiences
3 interviews found
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Graphs ,arrays , Hashmaps and Heaps
(2 Questions)
- Q1. Graphs related dfs
- Q2. Changes on graph structure
- Ans.
Changes on graph structure involve adding, removing, or modifying nodes and edges.
Adding a new node to the graph
Removing an existing node from the graph
Modifying the weight of an edge in the graph
Skills evaluated in this interview
I was interviewed in Dec 2020.
(2 Questions)
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 Rescheduling Challenge
Ninja is tasked with organizing a meeting in an office that starts at time ‘0’ and ends at time ‘LAST’. There are ‘N’ presentations scheduled with given start and end times....
- 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...
- Q2.
Total Unique Paths Problem Statement
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
- Ans. Recursive Approach
We can easily count the total number of paths by making a recursive algorithm.
The steps are as follows:
- 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.
- As our base condition, we will check if our number of rows (‘M’) or a number of columns (‘N’) is equal to 1. If...
(2 Questions)
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.
Minimum Operations to Connect a Graph
You are given a graph with 'N' vertices labeled from 1 to 'N' and 'M' edges. In one operation, you can shift an edge from being between two directly connected vertice...
- 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...
- Q2.
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
- Ans. BFS
We will use Breadth-First Search to find the shortest path from cellNumber 1 to cellNumber N*N.
- 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).
- Create a minDiceThrow array of size N*N initialise it with the maximum value (INT_MAX)
- Start with pushing cellNumber 1 and updating minDiceThrow[1] = 0...
(1 Question)
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 Problem Statement
Assume you initially have an empty array called
ARR. You are required to return the updated array after executingQnumber of queries on this array.There are two types of que...
- 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...
Interview Preparation Tips
Tip 1 : prepare all Topics from Coding Ninjas of Course Competitive Programming. Also I practiced atleast one question everyday from sites like Leetcode,Interviewbit and also took part in Codeforces Contest.
Tip 2 : Though Data Structure is the base for any tech interview, one must know some other subjects as well like Operating System, Networking, and Database Management System for which I took help from Coding Ninja’s notes and from GeeksforGeeks.
Tip 1 : Keep your resume up to date and mention 2-3 good level projects which will give a good impression to the interviewer .
Tip 2 : Don't put false things on the resume.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
There were a total of three questions of 100, 200, and 300 points respectively. Partial points were given if partial tests got passed for any problem. The Codesignal environment was similar to Hackerrank, so not much different. I think the test was held in the afternoon time.
- Q1.
Game of Stones Problem Statement
Two players, 'Ale' and 'Bob', are playing a game with a pile of stones. Your task is to determine the winner if both play optimally.
Rules of the Game:
1. On each turn, ...
- Q2.
Return Subsets Sum to K Problem Statement
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
Explanation:
A subset of an array 'ARR' is a tupl...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This round was a video call round held on Zoom and the Codesignal platform was to be used for coding the problems. The round started with the interviewer giving a small introduction about him and then asking me to introduce myself.
- Q1.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Q2.
Find Indices for Local Minima and Maxima
Given an integer array
arrof sizeN, your task is to determine all indices of local minima and local maxima within the array. Return these indices in a 2-D list, ...
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
The setup was exactly similar to the first interview round. The interviewer was very friendly. My advice will be to see the interviewer as a team mate and think you have to solve the question together with him. Don't panic and start speaking out what observations you can make about the problem.
- Q1.
Sort By Kth Bit
Given an array or list
ARRofNpositive integers and an integerK, your task is to rearrange all elements such that those with theK-thbit (considering the rightmost bit as '1st' bit) eq...
Round duration - 60 minutes
Round difficulty - Medium
It was already night time till this interview started because all the three interview rounds were held on the same day. This was not a DS+Algorithms round. He first asked me to introduce myself. So I started by telling what all I have done in my college up till now and then I told him about my internship experience at myKaarma which just ended few days back. There was around 10-15 minutes discussion on what I was working on in my intern project.
Interview Preparation Tips
Tip 1 : Try to learn DS+Algorithms from the basics in the starting phase of your preparation. Though, in the later stages of the preparation, some cramming can be employed for the problems generally asked in the interviews (but that too with proper understanding)
Tip 2 : Don't forget to prepare topics like OS and OOP. Although I was not asked much about these topics but my friends were asked some questions from these topics. These topics can be prepared in 2-3 days from YouTube itself.
Tip 3 : For an intern role interview, 2-3 projects including the college projects should be enough. You should be prepared to explain your project answer the basic questions like the approach which you followed, the problems you faced during the project, etc.
Tip 4 : If possible you can have a prior intern experience as well, but one thing for sure, preparing DS+Algorithms is much more important than this.
Tip 1 : Writing things which you don't know about properly won't give you much benefit. Rather, they can get you into problem if asked about them.
Tip 2 : Writing much about the things like extra curricular activities in the resume for software roles don't give you much benefit in my opinion. Though I wrote 2-3 PORs which had.
Tip 3 : Trying to make your resume longer unnecessarily won't give you any benefit.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Selected
I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.
More focus on dp,graphs.
(2 Questions)
- Q1. Focus on backend concepts,routing.
- Q2. Question on flood fill algo,backtracking.
I applied via campus placement at Institute of Technical Education and Research, Bhuvaneshwar and was interviewed in Jun 2023. There were 4 interview rounds.
Average difficulty basic questions
(1 Question)
- Q1. 2 codes 1 subquery OOPS DBMS Linux data structures
(1 Question)
- Q1. Based on understanding of OOPS and DBMS .In depth knowledge required.
Software Developer Intern Interview Questions & Answers
Expedia Group
Anonymous
posted on 16 Sep 2021
I was interviewed in Feb 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
The round was conducted on the HackerRank platform. It was conducted in the morning from 12:00 pm to 1:30 pm.
The only requirement was a stable internet connection.
- Q1.
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an... - Q2.
Date Reformatting
You have a string 'S' representing a date in the "Day Month Year" format, where:
- Day is one of {"1st", "2nd", "3rd", ..., "29th", "30th", "31st"}.
- Month is one of {"Jan", "Feb", "M...
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
It was conducted in the morning, at around 8 am, and was conducted on the Blue Jeans Platform. It was an online video interview, where the interviewer asked me 2 questions related to DSA.
- Q1.
Distinct Islands Problem Statement
Given a two-dimensional array/list consisting of integers 0s and 1s, where 1 represents land and 0 represents water, determine the number of distinct islands. A group of...
- Q2.
Count and Say Sequence Problem
The 'Count and Say' sequence is a series of strings in which each consecutive term is generated by describing the previous term. The sequence begins with '1'.
Your task is ...
(1 Question)
Round duration - 30 minutes
Round difficulty - Medium
This round was conducted after the first round in the morning. It was conducted at 10:00 am.
- Q1.
Distribute Items Problem Statement
Calculate the number of ways to distribute a given number of items 'N' among three people such that each person gets at least one item, and only one person receives the ...
Round duration - 45 minutes
Round difficulty - Medium
This was an HR round and was conducted on the same day at around 12:00 pm
Interview Preparation Tips
Tip 1 : Consistency is the key, be it only one or two questions daily, but be consistent.
Tip 2 : Be thorough with the concepts and do note rote learn them.
Tip 3 : Even if you have successfully solved a question, do see other approaches
Tip 4 : Have at least two good projects with which you are thorough.
Tip 1 : Resume should be concise, yet impactful.
Tip 2 : Keep only genuine content on your resume.
Skills evaluated in this interview
I was interviewed in Jan 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
- Q1.
Add Two Numbers Represented by Linked Lists
Your task is to find the sum list of two numbers represented by linked lists and return the head of the sum list.
Explanation:
The sum list should be a linked...
- Ans. Recursive approach
One way is to recursively add the two linked lists. Keep the nodes in the recursion stack and add the last nodes first and then second last and so on. Initially, find the size of both the linked lists. If both the linked lists are of the same size, add them using recursion. Else if their sizes differ, move the head pointer of the larger linked list forward K times, where K is the difference between th...
- Q2.
Check If Linked List Is Palindrome
Given a singly linked list of integers, determine if the linked list is a palindrome.
Explanation:
A linked list is considered a palindrome if it reads the same forwar...
- Ans. Using Stack
The idea is to store the list values in a stack and then compare the values in the list with the values in the stack.
Algorithm:
- Traverse the list from head to tail and push every node in the stack.
- Make a pointer ‘cur’ which initially points to the head node.
- If value at ‘cur’ is not equal to the top element of the stack, then the given list is not a palindrome
- Else, move the ‘cur’ pointer to its next node...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
- Q1.
Square Root with Decimal Precision Problem Statement
You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pl...
- Ans. Bruteforce
- We will find the integer part and decimal part of the answer separately.
- First, we will find an integral part.
- We will declare the answer variable where we will store the answer.
- Your answer could be between 1 and N so we will iterate through all the numbers from 1 to N.
- Let’s say we are currently at number i.
- If i ^ 2 = N then i is the exact answer so we will return i.
- If i ^ 2 < N then i could be a possible an...
- Q2.
Alien Dictionary Problem Statement
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...
- Ans. Permutations Approach
Approach:
- Find all the distinct characters present in all the words.
- Generate all permutations of these distinct characters.
- Treat each of the permutations as a correct sequence of alphabets. Now check if the given words are sorted according to this sequence. In order to do this, we will:-
- For all words from 1 to n - 1, let the current word be ‘currWord’ and the next word be ‘nextWord’.
- One by one compa...
Interview Preparation Tips
Tip 1 : The most fundamental and important thing to prepare are Data Structures and Algorithms. Be very much clear on your basics and skills.
Tip 2 : Revise OOPS thoroughly.
Tip 3 : Practice DSA (minimum 200), aptitude and reasoning questions regularly.
Tip 1 : The resume should not be more than 1 page. Be brief and write only those skills, projects or achievements which you have completed yourselves and have thorough knowledge. Avoid unnecessary details like hobbies, parent's name, photo, etc.
Tip 2 : Add a link to your LinkedIn, GitHub, website etc.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 30 minutes
Round difficulty - Easy
2 easy problems for coding.
- Q1.
All Prime Numbers Less Than or Equal to N
Given a positive integer
N, your task is to return all the prime numbers less than or equal toN.Note:
1) A prime number is a number that has only two factors:... - Q2.
Running Absolute Difference in Arrays
Given an array
ARRconsisting of 'N' non-negative integers, compute the running absolute difference of elements at even and odd index positions, respectively.Input:
...
Round duration - 30 minutes
Round difficulty - Hard
Face to face interview, design and coding involved.
Interview Preparation Tips
Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
I was interviewed in Jan 2021.
(2 Questions)
Round duration - 65 minutes
Round difficulty - Hard
Timing (6pm - 8pm)
Environment was user friendly
As usual the online round had three coding questions and 20 MCQs. This was a pretty easy round and it’s duration was 65 minutes. The round consisted of questions from various domains like Algorithm, Data Structure, Operating System and Aptitude.
- Q1.
Determine Count of Good Triplets
You are given two arrays
ARR1andARR2, containingNandMelements respectively. There are two types of 'good triplets' that need to be identified in these arrays.Type ...
- Q2.
Split the String Problem Statement
You are given a string
strconsisting ofNlowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha...
(2 Questions)
Round duration - 40 minutes
Round difficulty - Medium
- Q1.
Check if Two Trees are Mirror
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Explanation:
Two trees are considered mirror of each other if...
- Q2.
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
Interview Preparation Tips
Tip 1 : Must do questions from GFG.
Tip 2 : SDE sheet of striver can be helpful.
Tip 1 : Do at least 3 major web dev project
Tip 2 : should be precise and descriptive
Tip 3 : also add your past experiences in the resume
Skills evaluated in this interview
Software Developer Intern Interview Questions & Answers
Expedia Group
Anonymous
posted on 16 Sep 2021
I was interviewed in Dec 2020.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Medium
This round was carried out on Amcat. It was very user friendly platform and easily understandable. Countdown Timer was located at the top right corner that helped me to keep a check on the remaining time and I planned my answers and code accordingly.
- Q1.
Position of Right Most Set Bit
Determine the position of the rightmost set bit in the binary representation of a given number N.
Input:
T: Number of test cases
N: An integer for which the position of the... - Q2.
Ninja's Jump Task
The Ninja has been given a challenge by his master to reach the last stone. These stones are represented as an array of numbers. The Ninja can jump using either odd-numbered or even-numb...
(1 Question)
Round duration - 40 minutes
Round difficulty - Medium
This round was conducted on Hirevue platform which is a flexible and easy to use.
- Q1.
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
Round duration - 35 minutes
Round difficulty - Medium
This round lasted for almost half an hour and I enjoyed the conversation.
Interview Preparation Tips
Tip 1 : solve all the must do questions available at GeeksforGeeks
Tip 2 : having a team project will give you an edge over others
Tip 3 : practice regularly on Codeforces and build up good profiles
Tip 4 : if you are a fresher, then placement preparation course from coding ninjas can really help you in short span of time
Tip 1 : technical skills mentioned in the resume should be on your tips, can be asked anything
Tip 2 : having a team project will be good
Tip 3 : put the links of your competitive profiles in your resume, then your stats speak loud about your skill set
Skills evaluated in this interview
Uber Interview FAQs
Tell us how to improve this page.
Uber Interviews By Designations
- Uber Software Engineer Interview Questions
- Uber Software Developer Interview Questions
- Uber Business Analyst Interview Questions
- Uber Data Analyst Interview Questions
- Uber Senior Software Engineer 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
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Development Engineer Interview Questions
- Software Developer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Uber Software Developer Intern Interview Process
based on 1 interview
1 Interview rounds
- Coding Test Round
Software Developer Intern Interview Questions from Similar Companies
Fast track your campus placements
|
Driver
588
salaries
|  ₹1 L/yr - ₹7.2 L/yr |
|
CAR Driver
310
salaries
| ₹0.9 L/yr - ₹5.1 L/yr |
|
Software Engineer
157
salaries
| ₹20 L/yr - ₹84.7 L/yr |
|
Operations Executive
136
salaries
| ₹1.6 L/yr - ₹4 L/yr |
|
Data Analyst
128
salaries
| ₹6 L/yr - ₹22 L/yr |
Amazon
Ola Cabs
Airbnb
- Home >
- Interviews >
- Uber Interview Questions >
- Uber Software Developer Intern Interview Questions
