Uber Software Developer Interview Questions and Answers for Freshers

Q1. Why you want to join facebook?
Ans. 
I want to join Facebook because of its innovative technology, global impact, and opportunities for growth.
• Innovative technology: Facebook is known for its cutting-edge technology and constant innovation.

• Global impact: Working at Facebook would allow me to contribute to a platform that connects billions of people worldwide.

• Opportunities for growth: Facebook offers a dynamic and fast-paced work environment with ample opp...read more
Answered by AI
Add your answer
Q2. Whats the best feature you like in Facebook?
Ans. 
I appreciate the personalized news feed feature on Facebook.
• Personalized news feed shows content based on user interests

• Helps users stay updated on relevant information

• Allows users to engage with content they are interested in
Answered by AI
Add your answer

Q1 - array questions.
Q2 - Graph questions.
Q3 - DP questions

Round duration - 90 Minutes
Round difficulty - Medium

1 easy and 2 medium-hard DSA problems to solve

Q1. Hurdle Game
Once Kevin is playing a hurdle game in which he has to jump some hurdles to clear a particular level. Each level ‘i’ has ‘i’ hurdles (for example, level 6 has 6 hurdles).
You are provided wit...read more
Ans. Brute Force
The basic idea is to iterate through all the levels and keep subtracting the hurdles that Kevin has jumped. The steps are as follows:
 
1. Create two variables “hurdle” and “level” to count the hurdles that Kevin has jumped and to count the level cleared, respectively.
2. Iterate till the ”hurdle” becomes greater than ‘N’.
   • “hurdle” = “hurdle” + “level” + 1
   • “level” = “level” + 1
3. Return “level” - 1
Space Complexity: O...read more
Answered by CodingNinjas
View 1 more amswer
Q2. N Queens
You are given an integer 'N'. For a given 'N' x 'N' chessboard, find a way to place 'N' queens such that no queen can attack any other queen on the chessboard.
A ...read more
Ans. Backtracking
1. Instead of checking all the places on the chessboard, we can use backtracking and place queen row-wise or column-wise.
2. Suppose we place queens row-wise, and we start with the very first row. Place the queen and move to the next row until either there is a solution or there are no viable cells left.
3. As we backtrack, check to place the queen in the different columns of the same row.
4. When we can place a queen at ...read more
Answered by CodingNinjas
View 1 more amswer
Q3. Count Ways To Travel Triangular Pyramid
Bob has been given a triangular pyramid with its vertices marked as ‘O’, ‘X’, ‘Y’ and ‘Z’ and provided with another integer ‘N’. In a single step, Bob can go to any ...read more
Ans. Brute Force
The idea is very simple, as standing at any point we will always have three choices to move. So we will make a recursive function and call it for all three choices and decrease ‘N’ by 1 each time. So when ‘N’ will reach 0 then we will check the current position, if it is ‘O’ then we can say we have found a way.
 
Complete Algorithm :
• We will make a helper recursive function named ‘SOLVE’ which will receive...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 60 Minutes
Round difficulty - Medium

2 DSA problems and computer subject questions

Q1. Binary strings with no consecutive 1s.
You have been given an integer K.
Your task is to generate all binary strings of length K such that there are no consecutive 1s in the string. This means that the b...read more
Ans. Recursive Approach
Since we need to generate all substring which does not have consecutive 1s we can simply start adding new characters to the string until the length of the string is ‘K’ taking care that if the last character of the current string is ‘1’ we cannot add another ‘1’ as it will result in consecutive ‘1s.’ Otherwise, if the last character is ‘0’ we have 2 options either to add ‘1’ or ‘0’. We explore both th...read more
Answered by CodingNinjas
Add your answer
Q2. Shuffle Two Strings
You are given three strings “A”, “B” and “C”. Your task is to check whether “C” is formed by an interleaving of A and B. C is said to be interleaving “A” and “B”, if the length of “C” i...read more
Ans. Brute-force, Recursion
Approach:
 
To solve this problem, let us solve a smaller problem first. Let’s assume that the length of the string A and B is one and the length of the string C is two. Now to check whether C is formed by interleaving A and B or not, we consider the last character of string C, and if this character matches neither with the character of the string A nor with the character of string B, then we r...read more
Answered by CodingNinjas
View 3 more amswers

Round duration - 60 Minutes
Round difficulty - Easy

DSA round

Q1. Ninja And Geometry
Ninja has been given 2 points ‘A’ and ’B’ that corresponds to the line ‘AB’ and ‘P’, ’Q’ that corresponds to line ‘PQ’ on a 2D plane. Ninja wants to find the intersection point of the ‘A...read more
Ans. Mathematics
The idea behind this approach is to derive the equation of both of the lines ‘AB’ and ‘PQ’ and check if the Slope of these two lines is equal or not. Following are the two cases:
• If the slope of ‘AB’ and ‘PQ’ is the same that means they are parallel so we return -1.
• Else there must a point where ‘AB’ and ‘PQ’ are intersecting.
For a better understanding of this approach, Assume that we have two points which are...read more
Answered by CodingNinjas
Add your answer
Q2. Detect Cycle in a Directed Graph
Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph contains at least one cycle, else return false...read more
Ans. 
1. Create the graph using the given number of edges and vertices.
2. Create a recursive function that initializes the current index or vertex, visited, and recursion stack.
3. Mark the current node as visited and also mark the index in the recursion stack.
4. Find all the vertices which are not visited and are adjacent to the current node. Recursively call the function for those vertices, If the recursive function returns...read more
Answered by CodingNinjas
View 1 more amswer
Q3. Technical Questions
Started with spring beans, functional dependencies and asked how will check dependencies are valid or not. When I said they must be in the form of a directed acyclic graph. Then he asked...read more
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It is a managerial round

Q1. Networking Question
How does URL work and What is a load balancer.
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

Q1. Check If Linked List Is Palindrome
You are given a Singly Linked List of integers. You have to find if the given linked list is palindrome or not.
A List is a palindrome if it reads the same from the lef...read more
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:
1. Traverse the list from head to tail and push every node in the stack.
2. Make a pointer ‘cur’ which initially points to the head node.
3. If value at ‘cur’ is not equal to the top element of the stack, then the given list is not a palindrome
4. Else, move the ‘cur’ pointer to its next node...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Print all possible paths from top left corner to bottom right corner of a 2-D matrix
You are given an ‘M*N’ Matrix, You need to print all possible paths from its top left corner to the bottom right corner...read more
Ans. Recursion
The basic idea to solve this problem is to use recursion. Recursively call function   for next row ( row+1,col ) and next column ( row, col+1 ). If the row is equal to M-1 or the column is equal to N-1, then recursion is stopped.
 
Algorithm:
• Take an array or vector ‘path’, which will store the path we have to print.
• Start from the index (row, col) = (0,0).
• Add mat(row, col) to  ‘path.’
• Recursively ca...read more
Answered by CodingNinjas
Add your answer

Round duration - 70 Minutes
Round difficulty - Medium

The discussions were around binary search and started with an easy question. The closest integer to the square root of that number's to be find. Here you had to only change your code a bit her and there as per the question and requirement, but the logic is a bit tricky to find.The interviewer was quite impressed to see the approach and solution. I also had explained to them why was this the most optimal approach and time & space complexity

Q1. SQL Question
The given Database was having some records. The database was having the details about speed of bowlers and other details. Top 5 bowlers with maximum speed were to be identified by reading the r...read more
Add your answer