Leave your Email to get the latest Uber interview questions weekly. No spam we promise.
Uber Phone Interview Question 2019 May
(created 2019/05/03)
1, Search in Rotated Sorted Array
2, Search Insert Position
3, Common Elements
Uber Phone Interview Question 2019 May
(created 2019/05/02)
1, Reservoir Sampling
2, Trapping Rain Water
Uber Phone Interview Question 2019 May
1, Validate email address
2, Valid Parenthesis
Given a list of system packages, some packages cannot be installed until the other packages are installed. Provide a valid sequence to install all of the packages.
e.g.
a relies on b
b relies on c
then a valid sequence is [c, b, a]
4/5 Round at Uber
Coding: Given a 2D array of either '\' or '/', find out how many pieces this rectangle is divided into graphically.
For a 2X2 matrix with
/\
\/
The matrix split into 5 pieces - the diamond in middle and the four corners.
Return 5 as the answer.
5/5 Round at Uber
Design Excel.
1/5 Round at Uber
Manager : Behavioral questions. Basic system design concepts.
Publish/subscribe model. Discussion on Uber architecture.
2/5 Round at Uber
Bar raiser - Behavioral questions. Coding: Find if a set of meetings overlap.
Meeting has a starttime and an endtime with accuracy to minute. All meetings take place in the same day. Do this in O(n) time.
3/5 Round at Uber
Coding: Subset sum. Follow-up: Optimize the solution.
Convert a string with digits into a literal representation of the number like: 1001 to one thousand one
The matching should cover the entire input string (not partial).
The function prototype should be:
bool isMatch(String str, String pattern)
Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa","a{1,3}") → true
isMatch("aaa","a{1,3}") → false
isMatch("ab","a{1,3}b{1,3}") → true
isMatch("abc","a{1,3}b{1,3}c") → true
isMatch("abbc","a{1,3}b{1,2}c") → false
isMatch("acbac","a{1,3}b{1,3}c") → false
isMatch("abcc","a{1,3}b{1,3}cc{1,3}") → true
In pattern string, a char followed by {lower, upper} means that the char occur lower to upper(exclusive) times. e.g. a{1, 3} -> a occurs 1 or 2 times.
LeetCode
78 Subsets Medium
266 Palindrome Permutation Easy
249 Group Shifted Strings Medium
23 Merge k Sorted Lists Hard
125 Valid Palindrome Easy
8 String to Integer (atoi) Medium
337 House Robber III Medium
49 Group Anagrams Medium
54 Spiral Matrix Medium
121 Best Time to Buy and Sell Stock Easy
171 Excel Sheet Column Number Easy
33 Search in Rotated Sorted Array Medium
208 Implement Trie (Prefix Tree) Medium
36 Valid Sudoku Medium
161 One Edit Distance Medium
297 Serialize and Deserialize Binary Tree Hard
262 Trips and Users Hard
39 Combination Sum Medium
186 Reverse Words in a String II Medium
290 Word Pattern Easy
24 Swap Nodes in Pairs Medium
254 Factor Combinations Medium
291 Word Pattern II Hard
91 Decode Ways Medium
22 Generate Parentheses Medium
230 Kth Smallest Element in a BST Medium
10 Regular Expression Matching Hard
202 Happy Number Easy
138 Copy List with Random Pointer Medium
13 Roman to Integer Easy
104 Maximum Depth of Binary Tree Easy
242 Valid Anagram Easy
133 Clone Graph Medium
139 Word Break Medium
206 Reverse Linked List Easy
146 LRU Cache Hard
17 Letter Combinations of a Phone Number Medium
140 Word Break II Hard
1 Two Sum Easy
155 Min Stack Easy
373 Find K Pairs with Smallest Sums Medium
380 Insert Delete GetRandom O(1) Medium
37 Sudoku Solver Hard
76 Minimum Window Substring Hard
432 All O`one Data Structure Hard
450 Delete Node in a BST Medium
516 Longest Palindromic Subsequence Medium
535 Encode and Decode TinyURL Medium
648 Replace Words Medium
207 Course Schedule Medium
690 Employee Importance Easy
636 Exclusive Time of Functions Medium
692 Top K Frequent Words Medium
699 Falling Squares Hard
733 Flood Fill Easy
735 Asteroid Collision Medium
827 Making A Large Island