Recently completed Uber 2026 New Grad first and second round VO, currently receiving third round invitation. Both rounds were 45-minute coding rounds, and the overall experience was good. The Uber 2026 NG VO Interview interviewers were friendly and did not deliberately make things difficult.
Round 1 Coding + BQ (45 minutes)
BQ
The interviewer was an easy-going ABC girl. I introduced myself at the beginning, then spent 5-8 minutes briefly chatting about resume projects, and then moved on to behavioral questions, which mainly tested communication skills and teamwork:
- How do you usually help your colleagues or others on your team? Give an example.
- Let’s talk about the most challenging project you have ever done. What was the difficulty and how did you solve it?
- If you came to Uber, what would you most like to do? What value do you think you can bring?
After answering BQ, go directly to Coding.
Coding
Topic: Give you a bunch of meeting time intervals (start, end), find the time period with the largest number of simultaneous meetings, and return any one.
Problem-solving ideas: Classic scan line (Sweep Line) algorithm:
- Split each meeting into two events: start time +1, end time -1
- Sort by time and scan once to accumulate the current concurrent number in real time.
- Record the time period when the maximum concurrency value occurs
Follow-up 1: Instead of just returning one time period, we need to find out all the time periods that have reached the maximum number of concurrencies, and finally merge adjacent overlapping time periods.
Follow-up 2: The meeting is not given all at once, but comes dynamically (online) and needs to be processed in real time.
Upgrade ideas: Use TreeMap to dynamically maintain the change amount at each time point, update it every time a meeting comes, and track the current peak value in real time.
After successfully passing the first round, I quickly received an invitation for the second round of interviews (about 2-3 days after the first round). The second round is still a 45-minute coding round, and the interviewer is a very nice Senior Engineer (Indian).
Second round overall process
At the beginning, I briefly talked about my resume and first round of feedback, and then went directly to Coding.
Coding
Topic: Give you a bunch of meeting time intervals (each meeting has a start and end time), find the time period with the largest number of simultaneous meetings (just return any such time period).
Problem-solving ideas:
- Split each meeting into two events: start time +1, end time -1.
- Sort all events by time (if the time is the same, the end event is sorted before the start event to avoid boundary counting errors).
- Scan all events, accumulate the current concurrency number in real time, and record the maximum concurrency value and the corresponding time period.
After the code was written, the interviewer was very satisfied and went directly to Follow-up.
Follow-up 1: Instead of just returning one time period, we need to find out all the time periods that reach the maximum number of concurrencies.
Upgrade ideas: During the scanning process, each time the current count is equal to the maximum value, the current time period is recorded. Finally, adjacent or overlapping time periods are merged into continuous intervals and returned.
Follow-up 2(The difficulty increases significantly): Meetings are not given all at once, but arrive dynamically (online query). New meetings need to be processed in real time and the current peak value must be maintained.
Upgrade ideas: Use TreeMap (ordered map) to dynamically maintain the change (+1 or -1) at each time point. Every time a new meeting comes, the delta of the corresponding time point is updated, and the current maximum number of concurrencies and the corresponding time period are tracked in real time.
During the entire coding process, I explained the basic ideas clearly first, and then started writing code after the interviewer confirmed my understanding. The communication during the follow-up stage was also relatively smooth. He gave a few hints and finally passed successfully.
Overall experience of the second round
This round is slightly more difficult than the first, mainly in the online processing part of the Follow-up. But the interviewer had a very good attitude, guided me, and didn't deliberately make things difficult. I have prepared the usage of scan lines and TreeMap in advance, and the performance is quite stable.
We have received the third round of invitations and are continuing to prepare.
Advice for students preparing for Uber 26NG:
- Meeting scheduling questions (scanline + follow-up) are high-frequency, and you must be proficient in the online version (TreeMap/Segment Tree).
- When coding, you must first explain your ideas clearly. Interviewers attach great importance to communication and thinking process.
- Practice more progressive type questions (basic solution → Follow-up 1 → Follow-up 2).
If you are also sprinting Uber 2026 NG, welcome to leave a message or private message:
- Want to see the complete Python/Java code (including two follow-ups) of this conference concurrent question?
- Need a list of Uber VO high-frequency coding questions?
- Want to learn about your preparation experience for subsequent BQ/System Design rounds?
Also, if you are pressed for time and want to prepare Uber OA and VO efficiently, we recommend Programhelp Professional ancillary services.他们提供 OA 代写、实时思路引导和全流程支持，很多同学都通过他们顺利拿到了 Uber Offer。
