Uber interview notes, page 25 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

May 2026

Uber coding round for a software engineer role, one algorithmic question that looked like a simple DP problem but had a twist that made me second-guess my whole approach for a few minutes.

You're at index 0 of an array and need to reach the last index. At each position you can move to the next index, or jump directly to any future index whose value ends in the digit 3. Your score is the sum of values at every index you land on. Find the maximum possible score.

“Took me longer than it should have to see the structure.”

View Post

Uber·Data Scientist·Technical Phone Screen

May 2026

Uber DS interview with a single massive experiment design question covering basically every dimension of A/B testing you can think of. The depth expected was pretty intense for what felt like a single prompt.

Your company is running a promotion that gives users a discount when they open the app. Design a full randomized controlled experiment to evaluate whether this promotion works, covering: primary success metric and guardrails, unit of randomization and justification, eligibility and assignment rules, network effect detection and spillover quantification, sample size and test duration with stopping rules, and the instrumentation needed to compute intent-to-treat and treatment-on-treated estimates.

“This is basically six questions stapled together and presented as one.”

View Post

Uber·Software Engineer·Technical Phone Screen

May 2026

Uber coding interview with a grid traversal problem that sounds straightforward until you realize the query batching angle makes it way harder than a basic BFS.

You're given an m x n integer matrix and a list of limit values. For each limit, starting from (0,0), you can move in four directions and collect a cell's value only if it's strictly less than the limit and you haven't visited it before. You stop expanding as soon as you hit a cell that's >= the limit. Return the max points collectible for each limit value.

“My first instinct was just run a BFS for each limit independently, which technically works but felt wrong as soon as I said it out loud.”

View Post

Uber·Product Manager·Hiring Manager Screen

May 2026

Short PM screen at Uber, basically one estimation question about ride volume and that was it.

Estimate how many rides occur on Uber in a month.

“Classic Uber estimation and I still fumbled it a bit.”

View Post

Uber·Software Engineer·Technical Phone Screen

May 2026

Uber SWE coding round, one question on BST traversal. Pretty standard stuff but the follow-up on space complexity is where things get interesting and where I probably lost some points.

Given the root of a binary search tree and an integer k, return the kth smallest value in the tree (1-indexed).

“Got to the in-order traversal answer pretty fast, which felt good.”

View Post

Uber·Data Scientist·Technical Phone Screen

May 2026

Uber data scientist interview with a meaty streaming ML question that had a lot of moving parts. The kind of problem where you can tell they want to see how you think through constraints, not just whether you know k-means.

You're receiving a continuous, potentially unbounded stream of numeric values. Design and implement an online clustering solution that assigns each incoming number to a cluster using bounded memory. Your solution should support an add(value) operation and a get_clusters() operation, and you should discuss initialization, convergence, outliers, concept drift, and how you'd test it.

“This one took me a minute to even figure out where to start.”

View Post

Uber·Machine Learning Engineer·Technical Phone Screen

May 2026

Uber ML engineer round that was basically one long coding question dressed up as a design discussion. They wanted a full logistic regression implementation from scratch, runnable end-to-end, with a side conversation about regularization and convergence. More depth than I expected for a single question.

Implement logistic regression from scratch with fit, predict_proba, and predict methods. The implementation should use gradient descent on the negative log-likelihood loss, handle numerical stability in the sigmoid, and support binary classification with a 0.5 threshold.
How do you choose a learning rate, and what convergence criterion would you use for this implementation?
How would you add L2 regularization to this logistic regression implementation, and what effect does it have on the gradient update?

“This took up basically the whole session.”

View Post

Uber·Software Engineer·Technical Phone Screen

May 2026

Uber SWE interview, got a classic interval merging problem. Nothing too wild but the O(n) constraint meant you couldn't just brute force it and call it a day.

Given a sorted list of non-overlapping intervals and a new interval, insert the new interval into the list, merging any overlapping intervals as needed. Return the resulting sorted, non-overlapping list. Target O(n) time and O(n) space.

“I knew the general shape of this problem but the sorted input is actually a gift you have to use properly.”

View Post

Uber·Product Manager·Onsite - Product Sense / Strategy

May 2026

Uber PM interview with a product design question focused on large event experiences. Pretty open-ended, which I wasn't fully prepared for.

How would you redesign the experience of attending a large event? Walk through your implementation plan, testing approach, and what the user-facing experience would look like.

“I jumped straight into features and the interviewer had to pull me back to ask who exactly I was designing for.”

View Post

Uber·Software Engineer·Technical Phone Screen

May 2026

Uber SWE interview with a sliding window / sorted structure problem. Not the hardest question I've seen but the constraints tripped me up more than I expected.

Given an array of integers and a number N, find the length of the longest contiguous subarray where the difference between any two elements is less than N.

“My first instinct was a brute force O(n^2) scan and I actually started coding it before catching myself.”

View Post