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."
Detect cycle in directed dependency graph
You are given a directed dependency graph representing services in a system. - There are n services, labeled from 0 to n - 1. - You are given a list o...
Compute exclusive execution time from logs
Problem You are given execution logs from a single-threaded CPU that runs n functions labeled 0..n-1. The CPU can run only one function at a time. A f...
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...
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) ...
Find next and closest palindromes
Given a non-negative integer represented as a string n (no leading zeros unless n == "0"), return the smallest palindromic integer strictly greater th...
Find leftmost point of maximum brightness
You are given an array of lights, where each light is [p, r] representing a lamp centered at coordinate p on the real number line with radius r, illum...
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...
Find earliest common meeting slot
Question Given the calendars of N attendees, find the earliest time window of length at least d minutes during which all attendees are simultaneously ...
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...
Design room progression with leaderboard
Design a data structure to simulate a sequence of rooms where players solve tasks and can move only to the next room once finished. Support the follow...
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...
Find minimal rate k and subset sum
Question LeetCode 875. Koko Eating Bananas — Given vault sizes [3, 6, 7, 11] and time h = 8 hours, find the minimum integer rate k (vault units per ho...
Implement rate limiter, top-K, scheduler algorithms
Question Design and implement a thread-safe Rate Limiter; extend it to support multi-threading and a version where current time is not passed as an ar...
Parse and evaluate nested expressions with validation
Design and implement a parser/evaluator for a parenthesized expression language where the input string may be invalid. The language uses spaces as tok...
Simulate robot on grid with obstacles
Simulate robot on grid with obstacles A robot starts at (0, 0) on an unbounded integer grid. You are given a sequence of commands consisting of charac...
Thread-Safe Token-Bucket Rate Limiter
Thread-Safe Token-Bucket Rate Limiter Design and implement a thread-safe rate limiter using the token bucket algorithm. The limiter is shared by many ...
Group Anagrams
Group Anagrams Given an array of strings words, group together all strings that are anagrams of one another and return the groups. Two strings are ana...
Sort a String of Clothing Sizes
Sort a string containing only S, M, and L into size order in linear time. Extend the discussion to custom token orderings, unknown-size behavior, empt...
Reconstruct the Alphabet Order of an Alien Language
This question tests graph construction and topological sorting, core algorithmic skills for reasoning about partial orderings derived from constraints...
Maximize Throughput and Count Trigger Components
This question evaluates proficiency in algorithmic optimization under resource constraints (maximizing pipeline throughput within a budget) and in mod...