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."
Find the First Unique Log
This question evaluates a candidate's ability to analyze and implement efficient data-processing and frequency-detection strategies on ordered string ...
Solve 12 coding interview problems
Below are multiple independent coding problems. --- Problem 1: Reduce an integer to 0 with \(\pm 2^i\) You are given a positive integer \(n\). In one ...
Compute final prices with next smaller discount
You are given an integer array prices of length n, where prices[i] is the original price of the i-th item. For each item i, find the first index j > i...
Determine balanced k values in a permutation
You are given a permutation p of the integers 1..n. For a number k (where 1 <= k <= n), call k balanced if there exists a contiguous subarray p[l..r] ...
Design airport dispatch with ETA uncertainty
You control airport pickups with streaming ETAs for arriving flights and live driver locations/queues. Design an online dispatch algorithm that minimi...
Solve Prime Jumps and Pipeline Scaling
An online assessment contains two independent coding problems. Solve both. Problem 1: Prime-Constrained Score Jump You are given an integer array scor...
Move zeros to the front
This question evaluates array manipulation and in-place algorithm competencies, including handling space-time trade-offs and preserving relative order...
Return a Package Build Order
You are given an API: `python get_dependencies(package) -> list[str] ` It returns the direct dependencies of a given package. If package A depends on ...
Bracket substrings matching any pattern
This question evaluates string manipulation and pattern-matching competency, including substring search, prioritization rules for leftmost and longest...
Find robots matching obstacle-distance signature
This question evaluates spatial reasoning on 2D grids, the ability to compute distance signatures to nearest obstacles, and careful handling of bounda...
Simulate fixed-shape tiling on a grid
You are given an empty n-by-m grid and a list of tile patterns, patterns[0..k-1]. Each pattern is a binary matrix (1 = filled cell, 0 = hole) and must...
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 ...
Design top-K frequency structure
Design an in-memory data structure that supports: add(x) to observe an item, inc(x) to increment its frequency, dec(x) to decrement (deleting when zer...
Maximize Minimum Scaled Value
This question evaluates algorithmic optimization and resource-allocation skills, focusing on integer scaling under a global budget to maximize the min...
Track Customer Referral Revenue
This question evaluates understanding of dynamic data structure design and algorithms for maintaining aggregated metrics over a referral tree, specifi...
Solve jump maximization and palindromic path queries
This pair of problems evaluates algorithmic problem-solving skills: the first assesses array-based path optimization and stateful score maximization u...
Implement an expiring counter class
This question evaluates a candidate's competency in implementing a sliding-window expiring counter, testing knowledge of streaming algorithms, data st...
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...
Build a Quadtree and Analyze a Graph
Solve the following two coding problems. 1. Build a quadtree from an image You are given an N x N matrix of integers representing an image, where N is...
Choose K pickup locations minimizing L1 distance
Coding: K Shuttle Pickup Locations (L1) You are given the coordinates of N people on a 2D grid. You want to open K shuttle pickup locations (pickup po...