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."
Implement sqrt with Newton vs binary search
Implement numerically robust square-root routines and analyze convergence Task 1 — sqrt_newton(x, tol=1e-12) Implement a Python function that returns ...
Find all dictionary words in a grid
You are given: - A 2D grid of characters board with m rows and n columns. - A list of strings words (a dictionary). A word can be formed by starting f...
Simulate views on an n-ary tree
Given a rooted, ordered n-ary tree (each node has a value and an ordered list of children), simulate an observer who starts at the bottom-left, moves ...
Count subarrays with at least k fruit pairs
Given an integer array nums where each value denotes a fruit type, and an integer k: For any subarray, define a 'pair' for fruit value v if its freque...
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...
Minimize time using elevator then climb stairs
Problem You need to go up n floors (from floor 0 to floor n). You may: 1. Take the elevator first (at most once, only at the start) for k floors, wher...
Solve Several Algorithm Problems
The interview included several coding tasks: 1. Longest symmetric substring: Given a string s, return the longest contiguous substring that reads the ...
Compute CDF from a PDF Function
You are given a callable function pdf(t) that returns the probability density of a normal distribution at value t. Implement a function cdf(x) that re...
Compute build order from dependencies
Given a set of package build dependencies, output a valid build order so that each package is built only after all of its dependencies. The input is a...
Solve vault rate and subset-sum
1) Robber vaults rate: You are given an array vaults of positive integers where vaults[i] is the amount in the i-th vault, and an integer h (hours). I...
Sort by squares and find k-th smallest
Given a nondecreasing sorted array of integers nums, do the following: 1) Reorder the original elements by increasing square value (equivalently, by a...
Design structure for bottom-K customers by revenue
You are building an in-memory data structure to track customers’ current revenue and answer “top K” queries, where top K means the K smallest revenues...
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...
Check feasibility of AI course schedule
You are designing a learning path for n AI-related courses, labeled from 0 to n - 1. Some courses have prerequisites. For example, to take course b, y...
Maximize stock profit with one or two trades
You are given an array prices where prices[i] is the price of a given stock on day i (0-indexed). You want to maximize your profit by choosing when to...
Compute square root to 1 decimal
Problem Given a non-negative real number x, implement a function sqrt1dp(x) that returns \(\sqrt{x}\) rounded (or truncated—clarify with interviewer) ...
Compute currency conversion via graph search
Given a list of currency pairs, e.g., [('USD','CAD'), ('CAD','EUR'), ...], and a parallel list of conversion ratios [1.1, 1.2, ...] where ratio r mean...
Produce a valid deployment order
You are given N services and a list of dependency pairs (A, B) meaning service B must be deployed before service A. Compute any valid deployment order...
Simulate one-round color elimination on a grid
Given an m x n integer matrix board where board[r][c] > 0 represents a color and 0 represents empty: ( 1) A nonzero cell at (r,c) explodes in this rou...
Design top-K tracker with linked lists
Design top-K tracker with linked lists Design a data structure that tracks the top-K most frequent keys in a stream. Support operations increment(key)...