← Back to Directory

Uber interview notes, page 17 of 61

Large Enterprises

Most of these Uber write-ups come from Software Engineers (407), then Data Scientists (78) and Machine Learning Engineers (65). The most reported rounds are the technical phone screen (387), the system design round (95), the product sense round (46) and the onsite coding round (23).

609 interview notes · updated Aug 2026

Uber·Product Manager·Onsite - Product Sense / Strategy

May 2026
Uber PM interview with a classic CPO-style strategy question. Single question, pretty open-ended, and I spent probably too long trying to sound visionary instead of just being concrete.
  • You are the CPO of ChatGPT. What is your product strategy for the next two years?

“I went broad way too fast.”

View Post

Uber·Software Engineer·Technical Phone Screen

May 2026
Uber SWE interview with a pipeline throughput optimization problem. The question was algorithmically interesting and I think I got through it okay, but it took me a minute to see why binary search even applied here.
  • You have a serial pipeline where overall throughput is bottlenecked by the slowest service. Each service can be scaled up at a per-unit cost, and scaling a service by x multiplies its throughput by (1+x). Given a fixed total budget, maximize the pipeline's throughput.

“Took me a beat to recognize this as a binary search on the answer problem rather than a greedy or DP thing.”

View Post

Uber·Software Engineer·Online Assessment (OA)

May 2026
Uber coding round, part of their Hack2Hire process. Just one problem but it was enough to keep me busy.
  • Given a grid of characters, determine whether a target word exists as a sequence of adjacent cells along a single straight line (horizontal, vertical, or diagonal).

“Spent the first few minutes overcomplicating it.”

View Post

Uber·Software Engineer·Technical Phone Screen

May 2026
Uber software engineering interview that went deep into testing methodology for word-search algorithms. The question was less about writing code and more about how you think about coverage, failure modes, and test architecture at scale.
  • Design a full test plan and TDD workflow for two word-search functions, covering unit tests, property-based tests, and stress tests. Include concrete cases like empty inputs, all eight directional matches, diagonal-only paths, boundary crossings, repeated letters, multiple valid start positions, and large inputs for performance and stack depth.

“This one sprawled in a way I didn't expect.”

View Post

Uber·Software Engineer·Onsite - System Design / Architecture

May 2026
Onsite OOD round at Uber focused entirely on designing the cart and pricing engine for Uber Eats. The round starts deceptively approachable then gets into concurrency and edge cases fast. Prep the PricingStrategy interface before you walk in or you will feel it.
  • Design the core classes and interfaces for a food delivery cart system, including item customizations, pricing strategies, and a receipt breakdown.
  • How would you design a composable pricing strategy system where discounts, surge pricing, membership benefits, and promotions can be applied in a defined order?
  • How do you handle two devices modifying the same cart at the same time without losing updates?
  • What happens if the price of an item changes, or a promo expires, between when the user views the cart and when they check out?
  • How would you make the checkout operation idempotent so retries don't result in duplicate charges?
  • How would this design scale to tens of millions of concurrent orders across multiple regions?

“The receipt object is what actually gets graded, not whether your strategy code is pretty.”

View Post

Uber·Software Engineer·Technical Phone Screen

May 2026
Uber SWE interview that leaned hard into dynamic programming. Two parts to the same stock trading problem, starting simple and then ramping up. Not a bad experience but the second part took more thinking than I expected.
  • Given an array of daily stock prices, find the maximum profit you can make from at most one buy-sell transaction. Return 0 if no profit is possible.
  • Now extend the problem: you can make at most two non-overlapping buy-sell transactions. What is the maximum total profit achievable?

“Pretty standard stuff.”

View Post

Uber·Software Engineer·Technical Phone Screen

May 2026
Uber coding interview, tree problem, nothing too wild but the N-ary twist made me second-guess my recursion setup for a minute.
  • Given an N-ary tree where each node has a value, find the maximum sum along any root-to-leaf path.

“My first instinct was to track a global variable and do a standard DFS, which ended up being the right call.”

View Post

Uber·Software Engineer·Technical Phone Screen

May 2026
Uber SWE coding round, one question on BSTs. Pretty standard stuff but they pushed on complexity at the end which I wasn't fully ready for.
  • Given the root of a binary search tree and an integer k, find the value of the kth smallest element in the tree.

“Knew immediately it was an in-order traversal thing since BST in-order gives you sorted order.”

View Post

Uber·Software Engineer·Technical Phone Screen

May 2026
Uber SWE interview, coding round. One meaty graph/union-find problem with a bunch of follow-ups tacked on at the end. The core question wasn't too bad but the follow-ups came fast and I wasn't fully ready for the stream processing one.
  • Given a list of user IDs and a chronological log of ride-sharing events (each event records two users who shared a ride), find the earliest timestamp at which all users become part of a single connected component. Return -1 if they never all connect.
  • The log contains multiple event types. How would you modify your solution to only create connections for specific event types?
  • What if the log entries are not sorted by timestamp?
  • What is the time complexity of your approach?
  • How would your approach change if the log is extremely large and has to be processed as a stream, without loading it all into memory?

“Classic union-find setup once you see it, but I spent a minute fumbling around thinking about BFS before the structure clicked.”

View Post

Uber·Software Engineer·Online Assessment (OA)

May 2026
Took the Uber SWE online assessment and ran into a string problem that was trickier than the usual version I'd seen before.
  • Given a string, find the minimum cost to convert it into a 'wonderful' string (a variant of the classic wonderful string problem where a wonderful string has at most one character appearing an odd number of times).

“The base version of this problem is pretty well known but the cost-minimization twist changed the whole approach.”

View Post