Uber Interview Questions, Process, and Tips for Experienced

Round duration - 60 minutes
Round difficulty - Easy

Timing: evening
Environment: Online round took at home

Q1.  Smallest Subarray with K Distinct Elements
Given an array 'A' consisting of 'N' integers, find the smallest subarray of 'A' containing exactly 'K' distinct integers.
Note ...read more
Ans. 
At first sight this can be solved easily by using two loops to iterate over contiguous subarrays in O(n^2) and counting number of arrays and breaking the outer loop if number of odds exceed 'k'.

Optimised solution is to take two pointer approach where right pointer is incremented till num of odds not exceed 'k'. If limit is reached, increment left pointer and add number of arrays (right - left+1)*(right-left)/2 to the r
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Machine coding round

Round duration - 60 minutes
Round difficulty - Medium

Q1. Rat In a Maze All Paths
You are given a 'N' * 'N' maze with a rat placed at 'MAZE[0][0]'. Find and print all paths that rat can follow to reach its destination i.e. 'MAZE['N...read more
Ans. Backtracking Approach
Initialize, all the cells of the solution matrix used to print the path matrix to 0. First, you cannot make use of the existing maze to print the solution maze as you have to distinguish b/w 1 of maze or 1 of ‘SOLUTION matrix.
 
Form a recursive function, which will follow a path and check if the path reaches the destination or not. If the path does not reach the destination then backtrack and t...read more
Answered Anonymously
Add your answer

Round duration - 60-90 minutes
Round difficulty - Medium

Round duration - 60 minutes
Round difficulty - Medium

Hiring Manager round