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."
Determine Threshold-Constrained Connectivity
You are given an undirected weighted graph with n nodes labeled from 0 to n - 1 and a list of edges, where each edge is represented as (u, v, w) meani...
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...
Solve two interview coding problems
The interview included two coding problems. Problem 1: Find valid robot locations in a grid You are given a 2D grid containing empty cells and obstacl...
Determine Whether Queries Can Zero Array
You are given an integer array nums of length n and a list of range operations queries, where each query is of the form [l, r, val]. Process the queri...
Implement a Constant-Time Random Pool
Design a data structure RandomPool that stores unique integers and supports the following operations in average O(1) time: add(value), which inserts v...
Find possible robot positions
You are given a 2D grid where '.' represents an open cell and '#' represents a wall. A hidden robot is standing on one open cell. The robot's sensor r...
Find a Black-Box Convex Function Minimum
You are given access to a black-box function F(x): each call returns the function value at a real number x. You are also given a search interval [a, b...
Build a QuadTree From a Grid
Implement a compressed QuadTree for a square grid. You are given an n x n grid of values, where n is a power of two. The values are not limited to bin...
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 ...
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...
Build Quadtree and Find Grid Words
This interview included two algorithm problems. 1. Quad-partition tree: Given an n x n binary matrix where n is a power of 2, recursively build a tree...
Find Earliest Full Connectivity Timestamp
You are given: - A list of all user IDs in a ride-sharing system. - A chronological text log of ride-sharing events. Each relevant event contains a ti...
Choose root to minimize edge reversals
Problem You are given a connected graph with n nodes labeled 0..n-1 and n-1 directed edges. If you ignore directions, the edges form a tree (i.e., the...
Find the Next Larger Palindrome
Given a positive integer n, return the smallest integer strictly greater than n whose decimal representation is a palindrome. A palindrome reads the s...
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...
Find robots matching obstacle-distance signature
You are given a 2D grid and a distance signature dist = [left, top, bottom, right]. Grid Each cell is one of: - O : a robot - E : empty - X : obstacle...
Count Valid Infection Orders
You are given an integer n representing houses arranged in a line and indexed from 0 to n - 1, and a sorted array infected containing the indices of h...
Compute outer boundary of an N-ary tree
You are given the root of a rooted N-ary tree. Each node contains: - An integer value. - An ordered list of children from left to right (0 or more chi...
Compute time for virus to infect grid
You are given an m x n grid representing the state of individuals in a lab. - 0 = empty cell (no one) - 1 = healthy individual - 2 = infected individu...
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...