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.

"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."
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 ...
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...
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...
Count connected islands using Union-Find
You are given an m x n grid of characters where '1' represents land and '0' represents water. An island is a group of horizontally or vertically adjac...
Find earliest time all riders become connected
You are given activity logs for a ride-sharing app. Each log entry indicates that two riders shared a ride at a certain time, which creates an undirec...
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. -...
Solve DFS grid and keypad problems
You may be asked to solve one or more DFS/backtracking problems: 1. Grid connectivity problem: Given an m x n grid where 1 represents land and 0 repre...
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...
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...
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...
Find all dictionary words in a grid
You are given: - A 2D grid of characters board with m rows and n columns. - A list of strings words (a dictionary). A word can be formed by starting f...
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...
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...
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...
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...
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...
Bracket substrings matching any pattern
Problem You are given a sentence s (words separated by single spaces) and a list of strings patterns. For each word in the sentence, if the word conta...