Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

3430. Count Days Without Meetings

My accepted Python solution to LeetCode problem 3430, Count Days Without Meetings, running in 191ms.

  • Difficulty: Medium
  • Python
  • Runtime 191ms
  • Memory 52.6MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 191ms, memory 52.6MB, accepted 2025-12-31.

python
class Solution:
    def countDays(self, days: int, meetings: List[List[int]]) -> int:
        if not meetings:
            return days
        
        # Sort meetings by start time
        meetings.sort()
        
        # Merge overlapping meetings
        merged = []
        for start, end in meetings:
            if merged and start <= merged[-1][1] + 1:
                merged[-1][1] = max(merged[-1][1], end)
            else:
                merged.append([start, end])
        
        # Count total meeting days
        meeting_days = sum(end - start + 1 for start, end in merged)
        
        return days - meeting_days

Source