Uber Coding & Algorithms Interview Questions
Uber Coding & Algorithms interview questions center on practical problem solving at scale: expect timed coding exercises that mirror real engineering tasks rather than brainteasers. Interviews often use an online assessment (CodeSignal) and live 30–45 minute coding sessions on a whiteboard or shared editor, followed by deeper loop interviews for onsite or virtual rounds. What’s distinctive is the emphasis on clear, production-minded solutions that consider runtime and memory, edge cases, and how an approach would behave under Uber’s low-latency, geo-distributed constraints. For interview preparation, focus on algorithmic patterns (arrays, strings, trees, graphs, dynamic programming, hashing, sliding windows, and heaps) and on communicating trade-offs, complexity, and correctness as you code. Practice timed problems, run mock interviews, and rehearse explaining design choices and optimizations aloud. Senior candidates should also be ready to connect coding choices to system-level concerns like scaling and reliability. Good preparation shows up as concise planning, clean code, thoughtful test cases, and calm recovery from mistakes.

"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"

"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"

"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."

"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."

"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."

"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."

"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."

"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."

"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."

"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."

"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."

"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."

"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."

"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Solve DFS grid and keypad problems
You may be asked to solve one or more DFS/backtracking problems: 1. Grid connectivity problem: Given an m x n grid where 1 represents land and 0 repre...
Find minimum activations to absorb all balls
You are given n balls on a 2D plane, where ball i is at coordinate \((x_i, y_i)\). You are also given a distance threshold d. Two balls are considered...
Group strings that are anagrams
This question evaluates string-processing and data-structuring competency, focusing on identifying and grouping anagrams through comparison of unorder...
Implement FizzBuzz
This question evaluates a candidate's ability to implement basic control flow, use modulo operations, iterate over sequences, and reason about time an...
Find Kth Smallest in BST
You are given the root of a binary search tree and an integer k. Return the value of the node that would appear in the kth position if all node values...
Count connected islands using Union-Find
You are given an m x n grid of characters where '1' represents land and '0' represents water. An island is a group of horizontally or vertically adjac...
Compute max reachable cells per threshold
This question evaluates a candidate's ability to reason about constrained grid reachability and efficient handling of multiple threshold queries, test...
Check if each prefix forms 1..k permutation
You are given an integer array arr of length n that is a permutation of the numbers 1..n (each number appears exactly once), but in arbitrary order. F...
Find minimum reversals to orient edges away from root
You are given a connected graph with n nodes labeled 0..n-1 and n-1 directed edges. If you ignore edge directions, the edges form a tree. Each directe...
Compute sums and max path in N-ary tree
This question evaluates implementation and traversal skills for N-ary tree data structures, including recursion/DFS techniques, aggregation of node va...
Solve these algorithmic problems
You are given the following independent coding tasks. For each task, design an algorithm and implement a function that returns the requested output. -...
Move zeros to the front
Given an integer array nums, move all elements equal to 0 to the beginning of the array while preserving the relative order of all non-zero elements. ...
Find shortest jumps in circular array
You are given a circular array arr of length n. From index i, you may jump exactly arr[i] steps either to the left or to the right (wrapping around th...
Find all dictionary words in a grid
This question evaluates skills in grid traversal, string-search and pattern-matching techniques, recursive backtracking, and the efficient use of data...
Find earliest time all riders become connected
This question evaluates graph connectivity and dynamic event-processing skills, testing conceptual understanding of connectivity in undirected graphs ...
Move zeros to front
This question evaluates array manipulation and in-place algorithm skills, specifically competency in stable element reordering, index management, and ...
Count paths with prime-ending jumps
You are given an integer n representing the top of a staircase, where you start at step 0 and want to land exactly on step n. In one move, you may jum...
Convert a PDF to a CDF
Given a continuous random variable X with probability density function f(x), write code or describe an algorithm to construct its cumulative distribut...
Return sorted squares of a sorted array
This question evaluates array-processing and algorithmic optimization skills, including handling negative values, element-wise transformations, and pr...
Find earliest time all riders become connected
You are given a time-ordered log of events involving Uber riders. Each event has a timestamp and two rider names. Event types: 1. t X shared-ride-with...