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."
Last Truck to Leave a One-Dimensional Lane
Last Truck to Leave a One-Dimensional Lane Implement last_exit_time(lane_length, positions, velocities). Distinct trucks start at integer positions st...
Minimum Delivery Cost Between Cities
Minimum Delivery Cost Between Cities Implement minimum_delivery_costs(delivery_charges, queries). There are n cities indexed from 0 to n - 1, and city...
Kth Employee Reached in an Ordered Hierarchy
Kth Employee Reached in an Ordered Hierarchy Implement kth_recipients(boss, queries). Employees are numbered 0 through n - 1. boss[0] == -1; for every...
Shortest Path in a Grid with Blocked Cells
This question tests a candidate's practical grasp of graph traversal algorithms applied to 2D grid problems, specifically BFS for unweighted shortest-...
Solve stock profit and vertical tree traversal
You have a 60-minute coding interview with two algorithm questions: 1) Max profit from one stock trade - Input: an integer array prices, where prices[...
Implement stream queries and bounded-difference subarrays
This question evaluates proficiency in data structures and algorithmic problem-solving, covering streaming uniqueness tracking (first-non-repeated ele...
Schedule Non-Overlapping Meetings Efficiently
This question evaluates understanding of interval scheduling and overlap detection, proficiency in selecting efficient data structures for dynamic ord...
Deep Equality of Two Records
This coding question tests a software engineer's ability to implement recursive structural comparison across nested, heterogeneous data types. It eval...
Design and Implement an LRU Cache
This question evaluates a candidate's ability to design and implement an LRU cache data structure with O(1) time complexity for both reads and writes....
Solve Wonderful Strings and Grid Queries
This question evaluates algorithm design and data-structure competencies through two problems: a parity-constrained minimum-cost string transformation...
Build Quadtree and Find Grid Words
This question evaluates divide-and-conquer tree construction and recursive spatial data structures for the quadtree task, and grid-based search and ba...
Choose root to minimize edge reversals
This question evaluates understanding of directed versus undirected graph representations, tree rooting, and optimization of edge orientations, testin...
Quadtree for 2D Geospatial Points
Quadtree for 2D Geospatial Points Design and implement a point quadtree that stores geographic locations on a 2D plane and supports efficient axis-ali...
Solve BST and Grid Query Problems
This question evaluates understanding of binary search tree order-statistics and grid reachability under threshold constraints, testing competencies i...
Solve Several Algorithm Problems
This collection evaluates proficiency in string processing (longest palindromic substrings), graph connectivity and union‑find style concepts for 2D p...
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)...
Solve BFS and grid tasks
The coding rounds included several algorithmic problems: 1. Threshold search with binary search: You are given floors 1..n and an API canOperate(floor...
Solve Two OA Algorithm Problems
These problems evaluate algorithmic optimization and graph connectivity competencies, specifically cost-constrained integer resource allocation for th...
Replace Dashes With Nearest Letters
This question evaluates a candidate's competence in grid traversal, distance computation using Manhattan metrics, and handling tie-breaking rules incl...
Enforce ordered execution across threads
Enforce ordered execution across threads Implement a class with three methods alpha(), beta(), and gamma() that may be called by three different threa...