leetle

Daily challenge for 2026-06-09

525. Maximum Non-Overlapping Tasks

You are given an array of intervals tasks where tasks[i] = [start_i, end_i]. Return the maximum number of tasks you can complete without any overlap. Two tasks overlap if they share any time strictly inside their intervals (e.g., [1, 2] and [2, 3] do not overlap).

Example:
Input: tasks = [[1, 2], [2, 3], [3, 4], [1, 3]]
Output: 3

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