Daily challenge for 2026-07-16
562. Contained Interval Detector
Given a list of intervals where each interval is represented as a list of two integers [start, end], determine if there is any interval in the list that is completely contained within another interval. An interval [a, b] is completely contained within [c, d] if c <= a and b <= d. Return true if such an interval exists, and false otherwise.
Example:Input: intervals = [[1, 4], [5, 6], [2, 3]]Output: true
Explanation: The interval [2, 3] is completely contained within [1, 4].
Run this challenge interactively in Python or JavaScript when the app loads.