Can You Solve This Uber Scheduling Interview Question?
Can you solve a scheduling algorithm problem used in real Uber coding interviews? In this full-length mock coding interview, Rahman — a software engineer at Uber — walks through the Time Planner problem: given two people's availability slots and a meeting duration, find the earliest window where both can meet.
This unedited coding interview covers the complete problem-solving arc from clarifying questions through brute force ideation to an optimized two-pointer solution. You'll see how to identify interval overlaps using max-of-starts and min-of-ends, handle edge cases like empty slots and exact-fit durations, and simplify your code by removing redundant conditional branches. The solution runs in O(n + m) time with O(1) space — exactly what a real interviewer expects.
0:00 Introduction
0:23 Problem statement: Time Planner scheduling algorithm
2:22 Clarifying assumptions — sorted inputs, disjoint intervals
10:17 Time and space complexity analysis
12:50 Live coding the two-pointer solution
22:00 Testing with edge cases — empty slots, exact duration, large gaps
32:25 Interviewer feedback and follow-up optimization
Resources:
Interval List Intersections (LeetCode #986): https://leetcode.com/problems/interva...
Meeting Scheduler (LeetCode #1229): https://leetcode.com/problems/meeting...
Auf dieser Seite können Sie das Online-Video Can You Solve This Uber Scheduling Interview Question? mit der Dauer stunde minuten sekunde in guter Qualität ansehen, das der Benutzer abrar 06 Juni 2021 hochgeladen hat, den Link mit Freunden und Bekannten teilen, dieses Video wurde auf Youtube bereits 9,453 Mal angesehen und es wurde von 173 den Zuschauern gefallen. Viel Spaß beim Betrachtenden Zuschauern gefallen!
