Leetcode 3169. Count Days Without Meetings
Given a total number of days and a list of meeting intervals, return how many days in [1, days] are not covered by any meeting — effectively days minus the total length of the union of possibly overlapping intervals. Note meetings may overlap and days can be up to 1e9, so treat it as an interval-merging / sweep-line problem rather than per-day marking.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Early September, 2024
Mid-level
Find days where at least P people are available for meetings
Early September, 2024
Mid-level
Find available days for meetings given an array of unavailable date ranges for each person
Late August, 2024
Mid-level
Given calendars of N people with blocked dates, return the number of days when all are available in D days. Example: 3 people with blocked dates, D=10, output=2. Follow-up: Return number of days when at least P people are available. Constraints: Lists are not sorted, 1 <= D <= 10^5
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.