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."
Find a Bounded Subarray and Largest Square
Implement the following two independent coding tasks. Task A: Longest bounded-range subarray Given an integer array nums and an integer limit, return ...
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...
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: - ...
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...
Solve 12 coding interview problems
Below are multiple independent coding problems. --- Problem 1: Reduce an integer to 0 with \(\pm 2^i\) You are given a positive integer \(n\). In one ...
Compute sums and maximum path in a tree
You are given a binary tree whose nodes store integer values. You must implement your own Node class (e.g., val, left, right). Task Write a function t...
Solve two online assessment problems
An online assessment contained two coding problems: 1. Maximize skipped positions You are given an array of length n indexed from 0 to n - 1. Start...
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[...
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...
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...
Replace Dashes With Nearest Letters
You are given an m x n grid containing only dash characters '-' and alphabetic letters. For every dash cell, replace it with the nearest letter in the...
Solve jump maximization and palindromic path queries
You are given two independent algorithmic problems. --- Problem 1 — Jump game with special destinations (maximize score) You are given an integer arra...
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...
Implement binary search from scratch
Question Implement binary search on a sorted integer array without using any library helpers (no bisect, Arrays.binarySearch, etc.). Provide both iter...
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...
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...
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...
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...
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...
Find Any Available Meeting Room
You are given multiple meeting rooms. For each room, the existing bookings are represented as a list of non-overlapping time intervals sorted by start...