Uber Backend Engineer interview questions

5 Backend Engineers have shared notes from their Uber interviews, with the questions they were asked in each round. That is 1% of the 609 Uber interview notes on Screna AI.

5 Backend Engineer interview notes

Uber·Backend Engineer·Technical Phone Screen

Jul 2026
Uber backend interview with a combinatorics problem that looks deceptively simple but has some real math hiding underneath. The kind of question where you either see the pattern or you're just staring at examples hoping something clicks.
  • You have a 1D array of houses where some are initially infected. Each day, an infected house can spread to one neighbor. How many distinct orderings exist in which all houses eventually become infected?

“The setup sounds like BFS/simulation at first and I think most people go down that path before realizing it's a counting problem.”

View Post

Uber·Backend Engineer·Technical Phone Screen

Jul 2026
Uber backend interview, one coding question that was basically a BFS problem dressed up with a matrix of letters and dashes. Passed and moving to HR follow-ups, which I honestly didn't expect to feel so relieved about.
  • You're given a matrix with only dashes and letters. Replace each dash with the nearest adjacent letter (distance 1). If multiple letters are equally close, you can pick any. Follow-up: if there's a tie, use the alphabetically smallest letter.

“Recognized it pretty fast as a BFS thing, similar to the walls and gates problem.”

View Post

Uber·Backend Engineer·Technical Phone Screen

Jun 2026
Uber backend interview that went deep on dynamic graph connectivity, specifically a variant of the rider-connection problem where you have to handle both link additions and deletions in a time-sorted event log. The problem was harder than I expected and the follow-up about block events basically invalidated the approach I'd been building toward.
  • You have a time-sorted log of events between riders: connect events (two riders shared a ride) and block events (a rider blocked another, severing that link and potentially splitting a connected component). Find the earliest timestamp at which all riders belong to a single component. Standard Union-Find won't work because it can't handle deletions. Walk through your approach, its time complexity, and the key invariant that makes it correct.

“This wrecked me a little.”

View Post

Uber·Backend Engineer·Onsite - System Design / Architecture

Jun 2026
System design round at Uber for a backend role. The whole thing was basically one big cart service question that branched into like six different conversations. More open-ended than I expected, less algorithmic.
  • Design the shopping cart service for a food delivery app like Uber Eats, including adding, updating, and removing items with quantities and per-item customizations, scoped to a single restaurant.
  • How would you handle a user editing their cart from multiple devices at the same time? Walk through the tradeoffs between optimistic and pessimistic concurrency control here.
  • If a menu item goes out of stock or its price changes while the user has it in their cart, how do you reconcile that at checkout?
  • What storage solution would you choose for the cart service, and how would you handle TTL for abandoned carts?
  • How would you design the API for cart operations to be idempotent so client retries don't cause duplicate mutations?
  • How would you apply promotions, coupons, taxes, and delivery fees at checkout, and how does that integrate with order placement and payment?
  • How would you scale this cart service across multiple regions with low-latency reads?

“This is the core question and it sounds straightforward until you realize how many edge cases are hiding in 'per-item customizations.' I started with a basic CRUD API and a document store, which was fine, but I spent too long on the data model before they nudged me toward the harder parts.”

View Post

Uber·Backend Engineer·Onsite - System Design / Architecture

Apr 2026
Uber backend round, object-oriented design for a parking lot. Felt manageable at first but the concurrency and extensibility parts caught me flat-footed near the end.
  • Design and implement an object-oriented model for a parking lot with multiple levels, spot size categories, vehicle types, and a full park/leave/query API.
  • How would you search for the next available spot efficiently across levels and spot types?
  • Two vehicles arrive at the same level simultaneously. How do you ensure a spot is assigned atomically without double-booking?
  • How would you extend this design to support EV charging spots, reservations, and license-plate-based entry and exit?
  • How do you model the pricing policy so that different spot types can have different hourly rates and a minimum charge?

“I started with the class hierarchy and it went fine, Vehicle and Spot and Ticket are all pretty natural.”

View Post