How do I practice coding and algorithm questions?

Use PracHub's coding console to write, test, and debug your solutions in Python or JavaScript. View hints, test against sample inputs, and compare with official solutions.

What difficulty level is this coding question?

This is a medium difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at Uber.

What role is this question designed for?

This question is commonly asked for Data Scientist candidates at Uber during technical interviews.

Can one car serve all riders? | Uber Coding Question

Quick Overview

This question evaluates understanding of interval scheduling and conflict detection, testing skills in time-interval reasoning, sorting, and efficient comparison of ranges.

medium
Uber
Coding & Algorithms
Data Scientist

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.

You are given a list of passenger service intervals. Each interval is represented as [start, end], where start < end. A single car can serve at most one passenger at any moment in time. If any two intervals overlap, then the car cannot serve all riders. Intervals that only touch at an endpoint, such as [1, 3] and [3, 5], do not overlap and are allowed. Return True if one car can serve every rider without any scheduling conflict; otherwise return False.

Constraints

0 <= len(intervals) <= 100000
-1000000000 <= start < end <= 1000000000

Examples

Input: [[1, 3], [3, 5], [6, 8]]

Expected Output: True

Explanation: The first two intervals only touch at time 3, which is allowed. No pair overlaps.

Input: [[1, 4], [2, 5], [6, 7]]

Expected Output: False

Explanation: The intervals [1, 4] and [2, 5] overlap from time 2 to 4.

Input: []

Expected Output: True

Explanation: With no riders, there is no scheduling conflict.

Input: [[5, 7]]

Expected Output: True

Explanation: A single interval can always be served by one car.

Input: [[5, 10], [1, 2], [2, 5], [10, 12]]

Expected Output: True

Explanation: After sorting, the intervals are [1, 2], [2, 5], [5, 10], [10, 12]. They only touch at endpoints, so there is no overlap.

Input: [[-2, 1], [-1, 0], [1, 3]]

Expected Output: False

Explanation: The intervals [-2, 1] and [-1, 0] overlap, so one car is not enough.

Loading coding console...

Quick Overview

Can one car serve all riders?

Constraints

Examples

Hints