Coding Challenge on Data Structures

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Coding Challenge on Data Structures. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

Deel may need to determine how many workers are simultaneously available during a scheduling period. Given availability windows, return the maximum number of workers whose windows overlap at any moment.

Treat every interval as half-open, [start, end): a worker is available at start but not at end. This means a window ending at time t does not overlap one starting at time t.

Formal Specification

Implement max_concurrent_windows(intervals), where intervals is a non-empty list of [start, end] integer pairs. Return an integer representing the largest number of intervals active at the same time.

Constraints

1 <= len(intervals) <= 10^5
Each interval contains exactly two integers
0 <= start < end <= 10^9
Intervals may share start or end times

Function Signature

def max_concurrent_windows(intervals):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output