input: from typing import List
  
  def no_meeting_days(total_days: int, schedule: List[List[int]]) -> int:
      """
      Given a positive integer total_days representing the number of days an employee can work (starting from day 1), and a 2D array schedule of size n where, schedule[i] = [start_i, end_i] represents the start and end days of meeting i (inclusive).
  
      Return the number of days the employee can work without any scheduled meetings.
  
      Important:
      Meetings can overlap.
  
      Examples:
      >>> total_days = 10, schedule = [[5, 7], [1, 3], [9, 10]]
      2
      >>> total_days = 5, schedule = [[2, 4], [1, 3]]
      1
  
      Constraints:
      1 <= total_days <= 10^9
      1 <= schedule.length <= 10^5
      schedule[i].length == 2
      1 <= schedule[i][0] <= schedule[i][1] <= total_days
      """
output:     # Initialize a set to keep track of all meeting days
      meeting_days = set()
  
      # Iterate through each meeting in the schedule
      for meeting in schedule:
          start, end = meeting
          # Add each day of the meeting to the set
          for day in range(start, end + 1):
              meeting_days.add(day)
  
      # Calculate the number of non-meeting days
      non_meeting_days = total_days - len(meeting_days)
  
      return non_meeting_days