← Back to Directory

Uber interview notes, page 5 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 interview that came down to a tree traversal problem with a slightly unusual serialization format. Nothing too wild but the -1 separator twist kept it from being a pure rote exercise.
  • Given an N-ary tree serialized in level-order form where -1 acts as a separator between sibling groups, return the level-order traversal of the tree as a list of value levels.

“I recognized the BFS pattern pretty quickly but the -1 separator thing threw me off for a minute.”

View Post

Uber·Software Engineer·Onsite - System Design / Architecture

Apr 2026
Uber system design round for a software engineer role. The whole session was basically one big question about building a calendar scheduling service, but it branched into like six different sub-problems pretty fast. Felt like a reasonable interview but there's a lot of ground to cover.
  • Design a meeting scheduler service similar to Google Calendar or Calendly, supporting events with recurrence, attendee invites, RSVP tracking, and external booking links.
  • How would you efficiently find common free time slots across multiple attendees within a given time window?
  • How would you handle time zone correctness across users, including storage and display?
  • How would you design the data model for recurring events and exceptions to a recurring series?
  • How would you shard the database for a calendar service, and what are the tradeoffs of sharding by user versus by calendar?
  • How would you handle concurrent updates to the same event, such as two attendees RSVPing or two organizers editing simultaneously?
  • How would you ensure idempotent delivery of calendar invites and notifications?

“This is a wide question and I didn't scope it fast enough at the start.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber SWE coding round, one algorithmic problem about permutations and sliding windows. Tricky enough that I had to think out loud for a while before anything clicked.
  • Given a permutation of integers 1 through n, return a binary array of length n where the value at index w indicates whether any contiguous subarray of length w contains exactly the elements {1, 2, ..., w}.

“Took me an embarrassingly long time to see the key insight: a subarray of length w contains {1..w} if and only if its max element equals w and all elements are distinct (which is guaranteed by permutation).”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber SWE interview with a straightforward array/string problem. Nothing too wild, just index tracking under a time constraint.
  • Given an array of strings and two distinct words that both appear in it, find the minimum index distance between any occurrence of the two words.

“Pretty clean problem once you see it.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber SWE phone screen, pretty standard coding round. One problem, classic backtracking setup, but they pushed into a follow-up comparing recursive vs iterative approaches which is where things got more interesting.
  • Given a string of digits (2-9), return all possible letter combinations those digits could represent using a standard phone keypad mapping.

“Got through the backtracking solution fine, mapped each digit to its letters and recursed through positions.”

View Post

Uber·Machine Learning Engineer·Technical Phone Screen

Apr 2026
Uber ML engineer interview that went deep on linear regression fundamentals, both the math and the code. More involved than I expected for what sounds like a basic topic.
  • Implement linear regression from scratch, including both a closed-form solution using the normal equation and a gradient descent solution with configurable learning rate and iterations. Include a predict method.
  • When would you prefer the closed-form normal equation solution over gradient descent, and what are the tradeoffs around large datasets, high dimensionality, and ill-conditioned matrices?
  • How would you add L2 (Ridge) regularization to your linear regression implementation?
  • How would you evaluate the quality of your linear regression fit, and how would you distinguish between underfitting and overfitting?

“I started with gradient descent because it felt more natural to code up, then circled back to the normal equation.”

View Post

Uber·Software Engineer·Online Assessment (OA)

Apr 2026
Went through Uber's OA for a SWE role and got a bit-manipulation problem that looks straightforward until you hit the edge cases. The input arrives as a base-10 string which tripped me up initially, and the greedy logic for odd numbers has a subtle branch that I did not see coming.
  • Given a positive integer n (up to 2^60, passed as a base-10 string), find the minimum number of operations to reduce it to zero, where each operation adds or subtracts any power of two.

“I recognized this as a signed-binary representation problem partway through, which helped.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber SWE interview with a tree-based string problem that looks approachable until you actually think about the constraints. The palindrome angle is a nice twist but the ancestor path traversal part is where things get tricky fast.
  • You're given a tree where each node holds a character. For a given query node, count how many ancestors (including the node itself) have the property that the substring formed by the path from the query node up to that ancestor can be rearranged into a palindrome.

“My first instinct was to just do a DFS per query and track character frequencies as I walked up the path.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber coding screen, pretty standard sliding window stuff but the k-distinct twist tripped me up for a minute.
  • Given an integer array and an integer k, find the length of the shortest contiguous subarray containing at least k distinct integers. Return -1 if none exists.

“My first instinct was to think about longest subarray problems I'd seen before, and I almost went down the wrong path.”

View Post

Uber·Software Engineer·Technical Phone Screen

Apr 2026
Uber SWE interview with a graph/BFS problem that's a twist on the classic knight moves puzzle. Pretty standard technical screen but the bounded board constraint is what separates the people who actually think it through from the people who just recite the infinite-board solution.
  • Given an N×N chessboard with a knight at a starting square, find the minimum number of moves to reach a target square. The knight cannot leave the board. Return -1 if the target is unreachable.

“My first instinct was BFS and that's correct, but I almost forgot to handle the boundary check inside the neighbor generation.”

View Post