Company sheets › Uber
Uber interview preparation
Ride-hailing and delivery platform with a large engineering centre in India. SDE and intern roles through campus drives, referrals and online applications; most of the process is DSA.
Uber hiring process
- Online assessment — Two or three coding problems of medium difficulty (sometimes with CS MCQs), usually on HackerRank, HackerEarth or Codility.
- DSA interviews (2–3) — Arrays, strings, trees, graphs, DP and heaps — explain your approach, write clean code, analyse time and space.
- CS fundamentals / design — OOP, operating systems, DBMS, networks; sometimes a small low-level design problem.
- Hiring manager / behavioural — Projects, teamwork, handling conflict and why you want to join.
The process changes from year to year — check the official notice for the exact pattern.
Interview topics
- DSA interview questions
- OOP interview questions
- Operating Systems interview questions
- DBMS interview questions
- Computer Networks interview questions
- System Design interview questions
Tips
- Uber has run the HackTag hiring contest for students — keep an eye out for it.
- Talk through a brute-force idea first, then optimise — interviewers grade your thinking, not only the final code.
- Make the standard patterns automatic: two pointers, sliding window, BFS/DFS, binary search on the answer, DP.
- Prepare 4–5 short stories (a hard bug, a conflict, a deadline, a failure) for the behavioural questions.
Uber DSA problems (33)
- Longest Consecutive Sequence — Medium
- Merge Intervals — Medium
- Maximum Product Subarray — Medium
- Next Permutation — Medium
- Reverse Pairs — Hard
- Happy Number — Easy
- Word Pattern — Easy
- Group Anagrams Count — Medium
- Longest Repeating Character Replacement — Medium
- Minimum Window Substring — Hard
- Generate Parentheses — Medium
- Combination Sum Count — Medium
- Letter Combinations of a Phone Number — Medium
- Word Search — Medium
- Sudoku Solver — Hard
- Asteroid Collision — Medium
- Sum of Subarray Minimums — Medium
- LRU Cache — Hard
- K Closest Points to Origin — Medium
- Merge K Sorted Arrays — Medium
- Task Scheduler — Medium
- Kth Smallest Element in a BST — Medium
- Implement a Trie — Medium
- Maximum XOR with a Limit — Hard
- Flood Fill — Easy
- Shortest Path in an Unweighted Graph — Medium
- Number of Islands — Medium
- Dijkstra's Shortest Paths — Medium
- Course Schedule — Medium
- Distance of Nearest Zero — Medium
- Longest Palindromic Subsequence — Medium
- Distinct Subsequences — Hard
- Candy — Hard