leetle

Daily challenge for 2026-08-04

581. Chronological Meeting Scheduler

You are given a list of intervals representing meeting times, where each interval is a pair of integers [start, end]. Sort the meetings chronologically by their start time. If multiple meetings start at the same time, sort them by their end time in ascending order.

Example:
Input: intervals = [[15, 20], [5, 10], [5, 8]]
Output: [[5, 8], [5, 10], [15, 20]]

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