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."
Compute sums and max path in N-ary tree
You are given the root of an N-ary tree (each node can have 0..k children). Implement the Node class yourself. Assume each node stores an integer valu...
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...
Group strings that are anagrams
Given an array of strings, group the strings into lists such that each list contains strings that are anagrams of each other. Definition Two strings a...
Print directory tree with indentation
You are given a root directory of a filesystem represented as a tree. Each node is either a directory (can have children) or a file (no children). Pri...
Count connected delivery zones
Given an m x n grid representing a service area, each cell is either 'Z' (deliverable zone) or '#' (blocked). Two 'Z' cells belong to the same zone if...
Move zeros to front
Given an integer array nums, move all 0 values to the beginning of the array in place while preserving the relative order of all non-zero elements. Re...
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...
Design time-versioned KV without timestamp argument
Design a time-versioned key-value store that does not accept a timestamp argument on writes. Support set(key, value) which stores the value with an in...
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...
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 ...
Find earliest common meeting slot
Given the busy calendars of two or more participants as non-overlapping intervals within daily working bounds and a required duration d, find the earl...
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...
Implement Cache Eviction And Seat Assignment
Solve the following two independent coding tasks. Task 1: Implement a least-recently-used cache Design a class LRUCache with the following methods: - ...
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), decrement(key), and topK(k) -> list o...
Implement binary search from scratch
Implement binary search on a sorted integer array without using any library helpers. Return the index of the first occurrence of the target or -1 if 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...
Count paths with prime-ending jumps
You are given an integer n representing the top of a staircase, where you start at step 0 and want to land exactly on step n. In one move, you may jum...
Find minimum activations to absorb all balls
You are given n balls on a 2D plane, where ball i is at coordinate \((x_i, y_i)\). You are also given a distance threshold d. Two balls are considered...
Evaluate an Arithmetic Expression
Implement an expression evaluator for a simplified calculator. Given a string s, return the integer value of the expression. The expression may contai...
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) ...