Uber SSE/L5a Interview Experience | April/May 2026
Summary
I attended two Business Phone Screen rounds with Uber for an SSE role in 2026, both of which ended in rejection.
Full Experience
Timeline - one in April and one in May 2026 YOE (then) : 8.5+ Years Current (Most Recent Company) : SMTS(IC3) at Oracle (Laid off in September 2025) College - IITK
Directly applied on their portal to multiple jobs, Recruiter reached out to me directly - Once for an in-office hiring drive in April and once again in May for another team in May which was virtual interview.
- Writing both expeirence in one post because I couldn't go past the Business Phone Screen (BPS) round both the times.
First Attempt : R1/BPS (DSA Coding) - Happend in April in Uber Office Sarjapura, Bengaluru
Given a n number of vertical lines in an XY plane, assume the length of lines is infinity, there also exists m number of rectangles in the plane, if a line cuts through a rectangle, then it makes two intersection points with the rectangle (one point with the upper horizontal line of rectangle, another with lower horizontal line), if a line aligns or overlaps over the vertical line of the rectangle then it is not considered any intersection point. Find the total number of intersection points in efficient time and space complexity.
- Couldn't solve the question despite the "binary search" hint from the interview. Got the expected rejection immediately after interview. This was my first WhiteBoard interview experience though so felt a little odd. I was used to sit on a laptop and think with a pen and paper in hand rather than standing with a laptop and thinking looking at whiteboard. Overall good experience and got to know where I currently stand and what all work I need to put more.
Second Attempt : R1/BPS (DSA Coding) - Happend in May over Zoom call https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/description/
- Almost Figured out the optimal approach and coded up the solution but missed the trick in shrinking the sliding window from left side. I tried using minHeap and maxHeap but that wasn't correct. Since couldn't complete the working optimal solution, it was a reject.
Hope these can help someone appearing for Uber interviews. All the very best.
Note :- Recruiter mentioned that the cool off is 3 months and I can apply again after 3 months.
Interview Questions (2)
Count Intersection Points between Vertical Lines and Rectangles
Given n vertical lines of infinite length on an XY plane and m axis-aligned rectangles, determine the total number of intersection points where a vertical line crosses a rectangle. A line intersecting a rectangle creates two points (one with the upper horizontal edge, one with the lower). Overlaps with the rectangle's vertical edges do not count as intersections. Provide an algorithm with efficient time and space complexity.
Longest Continuous Subarray with Absolute Diff <= Limit
Find the length of the longest contiguous subarray such that the absolute difference between the maximum and minimum elements in the subarray is less than or equal to a given limit.