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.