← Back to Directory

Uber interview notes, page 4 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·Software Engineer·Technical Phone Screen

Apr 2026
Uber SWE coding round, one algorithmic problem on array manipulation. Pretty clean question once you see the pattern, but I fumbled around longer than I should have before landing on the right structure.
  • Given an integer array and a list of range-decrement queries (each specifying a range and a max decrement value), determine whether it's possible to reduce every element in the array to zero by applying all queries in order.

“I kept trying to simulate it directly at first, iterating over each range per query, which is obviously too slow.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber SWE technical phone screen, one coding question the whole time. Pretty focused on BST traversal with a twist, and they wanted iterative only so no recursion cop-outs.
  • Given the root of a binary search tree and an integer k, return the k-th largest element (1-indexed). You must write an iterative solution, not recursive.

“It's basically a reversed in-order traversal.”

View Post

Uber·Machine Learning Engineer·Technical Phone Screen

Apr 2026
Uber ML Engineer interview with a geometry coding problem. Nothing too wild but the math details matter more than you'd expect.
  • Given four 2D points, write a function to determine whether they form a valid square.

“My first instinct was to sort the points and check side lengths, which works for axis-aligned cases but falls apart once the square is rotated.”

View Post

Uber·Software Engineer·Onsite - System Design / Architecture

Apr 2026
System design round at Uber for a software engineer role. The interviewer was relentless and the communication between us was rough the whole way through. Probably the most uncomfortable technical interview I've sat through.
  • Design a system for searching nearby restaurants.

“Got grilled on this way harder than I expected.”

View Post

Uber·Software Engineer·Online Assessment (OA)

Apr 2026
Uber SWE online assessment, one coding problem that's basically a twist on a well-known LeetCode problem. The extra output requirements tripped me up more than the core algorithm did.
  • Given an array of prices, for each item find the first later item whose price is less than or equal to it and apply that as a discount. Return the total sum of all final prices, plus the 0-based indices (ascending, space-separated) of items that received no discount and sold at full price.

“The base problem is LC 1475 so I felt fine at first, but the OA version asks for two things: the total and the list of undiscounted indices.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber coding round, one algorithmic problem on permutations. Pretty clean problem once you see the trick, but I didn't see it immediately.
  • Given a permutation of 1 through n, for each k from 1 to n, determine whether some contiguous subarray is a permutation of 1 through k. Return a binary string where position k is '1' if such a subarray exists and '0' otherwise.

“My first instinct was something like sorting or a set membership check per k, which would've been way too slow.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber SWE interview with a log processing problem that had a deceptively simple premise but a follow-up that pushed into real engineering territory.
  • Given a list of logs, return the first log entry that appears exactly once. Follow-up: how would your approach change if the input scaled to 10 million logs?

“The base problem is pretty straightforward, a single pass with a hash map to count frequencies, then a second pass to find the first with count one.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Phone screen for a SWE role at Uber, one coding/design question the whole time. The problem sounds deceptively simple until you realize they want true O(1) and won't accept a scan.
  • Design a data structure that tracks a stream of website visits by customer ID and supports two operations: recording a visit, and returning the earliest customer who has visited exactly once so far. Both operations must run in constant time.
  • How would you scale this system to handle tens of millions of visit events per second?

“I started with a hashmap for counts and thought I was done.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber SWE coding round with a bit representation problem that looks deceptively clean until you realize the optimal path isn't just counting set bits.
  • Given a positive integer n, you can add or subtract any power of two in a single operation. What is the minimum number of operations needed to reduce n to zero?

“My first instinct was just count the 1-bits in the binary representation and call it a day.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber SWE technical phone screen with a single graph/topological sort problem. Felt decent about my solution but got the 'we're moving forward with another candidate' email a week later.
  • Given a target package and an API that returns the direct dependencies of any package, output a valid build order so that all dependencies are built before the target. Return empty or throw an error if a cycle exists.

“The twist is you don't get the full graph upfront.”

View Post