leetle

Daily challenge for 2026-05-08

493. Merge Overlapping Meeting Blocks

You are given a list of intervals where each interval represents a meeting block with a start and end time. Your task is to merge all overlapping intervals and return the total number of unique meeting blocks remaining after the merge. Two intervals overlap if they share any point in time, including their boundaries. Example: Input: intervals = [[1, 3], [2, 4], [6, 8]] Output: 2

Run this challenge interactively in Python or JavaScript when the app loads.