Uber Software Engineer Coding & Algorithms Interview Questions
Practice 110 real Coding & Algorithms interview questions for Software Engineer roles at Uber.

"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."
Return a Package Build Order
You are given an API: `python get_dependencies(package) -> list[str] ` It returns the direct dependencies of a given package. If package A depends on ...
Implement Last-Click Attribution APIs
Design and implement an in-memory last-click attribution service. There are two event types: - click(timestamp, userId, campaignId) - conversion(times...
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...
Implement three interview-style coding tasks
You are given three separate coding tasks, all focused on algorithm and data-structure design. --- Task 1: Longest Bounded-Difference Subarray You are...
Implement an expiring counter class
Expiring Counter (sliding time window) Design and implement an expiring counter that counts events in a recent time window. Requirements - You are giv...
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...
Check feasibility of AI course schedule
You are designing a learning path for n AI-related courses, labeled from 0 to n - 1. Some courses have prerequisites. For example, to take course b, y...
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 ...
Count subarrays with at least k fruit pairs
Given an integer array nums where each value denotes a fruit type, and an integer k: For any subarray, define a 'pair' for fruit value v if its freque...
Implement 2D word search variants and analyze complexity
Given an m x n grid of uppercase letters board and a string word, implement two related functions: ( 1) Fixed-direction search: Return true if word ap...
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...
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)...
Parse and evaluate nested expressions with validation
Design and implement a parser/evaluator for a parenthesized expression language where the input string may be invalid. The language uses spaces as tok...
Track Customer Referral Revenue
Design a data structure to track customers and referral-based revenue. Implement the following operations: - int insertNewCustomer(double revenue) -...
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...
Produce a valid deployment order
You are given N services and a list of dependency pairs (A, B) meaning service B must be deployed before service A. Compute any valid deployment order...
Compute exclusive execution time from logs
Problem You are given execution logs from a single-threaded CPU that runs n functions labeled 0..n-1. The CPU can run only one function at a time. A f...
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...
Compute build order from dependencies
Given a set of package build dependencies, output a valid build order so that each package is built only after all of its dependencies. The input is a...
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...