1p3a Experience · May 2026

uber software engineer tech phone screen: simulation and input generation challenges

SWE Phone Screen newgrad
2 upvotes

Interview Experience

烙印语气很友善 第二题我认为 没做过的话很难想到 corner case 难搞 我看了近6个月面经 没看到这一题 也不是leetcode uber tag 题目是 [1, 2, 3, 4, 5, 6, 7, 8] 代表rank,数字越小rank约大 然后 index 0, 1 比赛,2,3比赛 。。。 保留rank数字小的 [1, 3, 5, 7] [1, 5] [1] 所以第一题是simulation, 很简单,output每一步就行,注意odd n的情况 第二题是让你生成第一题的input,要求是保障数字小的rank得比数字大的rank晚elimite 其实就是利口舞斯斯的升级版,没有 n = 2^x 的限制 比如 1 8 4 7 2 6 3 5 1, 4, 2, 3, 1, 2 1 没有那么难 但是面完我发现被烙印带沟里去了 我一开始我问能不能从下往上iterate,他说可以, 其实只有n = 2^x的情况才iterate比较好写 recursion会简单很多 后来他说不用关心odd n情况,先解决even n,-> 这个hi...

Full Details

🔒

Unlock all Uber questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — from $50/mo

About This Question

This is a candidate experience report from a uber interview for a swe role (newgrad level) during the phone screen round reported in 2026.

It covers the following topics: Strings .

Topics

About Uber Interview Reports

This question was reported by a candidate who interviewed at Uber. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.

Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Uber are the higher-signal extractions to take from this report.

For broader preparation context, the Uber interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.

How To Practice This Type of Question

Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.

Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Uber reports consistently are the ones worth investing in; one-off niche problems are not.

During Your Uber Round

Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.

The single most predictive failure mode in Uber reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.