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."
Schedule Non-Overlapping Meetings Efficiently
Implement a meeting scheduler that stores meetings as half-open intervals [start, end), where start and end are integer timestamps and start < end. Th...
Find the First Unique IP
You are processing a chronological stream of server hit records. Each record contains an IP address as a string. Design and implement a component that...
Compute CDF from a PDF Function
You are given a callable function pdf(t) that returns the probability density of a normal distribution at value t. Implement a function cdf(x) that re...
Implement a Referral Revenue Tracker
Implement an in-memory revenue tracking system for customers in a referral network. Each customer has their own direct revenue. A customer may also ha...
Solve BST and Grid Query Problems
Solve the following coding problems. Problem A: Find the kth largest value in a BST You are given the root of a binary search tree and an integer k. R...
Implement Store Autocomplete
You are given a list of store names, for example: `text ["McDonald's", "KFC", "Burger king", "Bites", "Biscuit shop"] ` Implement an autoComplete(s) m...
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...
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...
Solve these algorithmic problems
You are given the following independent coding tasks. For each task, design an algorithm and implement a function that returns the requested output. -...
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...
Find First Local Minimum
Given an integer array nums, find the index of the first local minimum. A local minimum is an element that is smaller than its immediate neighbors: - ...
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...
Compute max reachable cells per threshold
You are given: - An m x n integer matrix terrain. - An integer array limits of length k. For each query value L = limits[i], you start at the top-left...
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] ...
Find minimum reversals to orient edges away from root
You are given a connected graph with n nodes labeled 0..n-1 and n-1 directed edges. If you ignore edge directions, the edges form a tree. Each directe...
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...
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...
Check if each prefix forms 1..k permutation
You are given an integer array arr of length n that is a permutation of the numbers 1..n (each number appears exactly once), but in arbitrary order. F...
Implement Minesweeper and Word Search
Solve the following coding problems. Problem 1: Generate and Print a Minesweeper Board You are given integers rows, cols, and mineCount. Generate a ro...
Solve Balanced Permutations and Tree Reversals
You have 90 minutes to solve the following two independent coding problems. Problem 1: Balanced Prefix Values in a Permutation You are given a permuta...