Uber·Software Engineer·Online Assessment (OA)
Jul 2026
Uber SWE OA, one algorithmic problem about simulating round-trip mission scheduling across two sorted timetables. Pretty niche problem, felt like it was pulled from an older CodeSignal bank rather than something freshly written.
- Given two sorted arrays of departure times from locations A and B, and a mission count m, simulate m round trips (A to B and back, each leg taking 100 time units, always catching the next available departure). Return the earliest time the last mission completes back at A.
“I went with binary search first because two pointers felt fiddly to get right under pressure.” The rest of the author's notes on Software Engineer interview at Uber, Online Assessment (OA) round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post