Max Overlap Days Out of Office

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Max Overlap Days Out of Office. 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

Deem's travel tools store each employee's travel as an inclusive interval from an in date to an out date. Given two employees' travel schedules, find the maximum number of consecutive calendar days during which both employees are away from the office.

A schedule may contain overlapping or adjacent trips. Treat adjacent trips as one continuous away period. If the employees are never away at the same time, return 0.

Formal Specification

Implement max_shared_away_days(schedule_a, schedule_b).

schedule_a and schedule_b are lists of two-element lists.
Each interval is [in_date, out_date], where both values are strings in YYYY-MM-DD format.
Every interval has in_date <= out_date.
Return an integer representing the longest inclusive overlap in calendar days.

Constraints

0 <= len(schedule_a), len(schedule_b) <= 10^5
Each interval contains exactly two valid YYYY-MM-DD strings
Every interval satisfies in_date <= out_date
Dates are between 1900-01-01 and 2100-12-31
Intervals are inclusive
Adjacent intervals within one schedule should be merged

Function Signature

def max_shared_away_days(schedule_a, schedule_b):

Your solutionPython 3

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

Run your code to see test output