Can one car serve all riders?
Company: Uber
Role: Data Scientist
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Given a list of passenger waiting intervals, determine whether a single car can serve all passengers without any scheduling conflict.
Each interval is given as [start, end], where start < end. Assume the car can serve at most one passenger during any time interval, and two intervals that overlap imply a conflict. Intervals that only touch at an endpoint, such as [1, 3] and [3, 5], are not conflicts.
Return true if no intervals overlap; otherwise return false.
Quick Answer: This question evaluates understanding of interval scheduling and conflict detection, testing skills in time-interval reasoning, sorting, and efficient comparison of ranges.