Atlassian OA Question 2024 September | Intervals | on-campus

Question: Non-overlapping Intervals Problem Statement Given an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping. Note that intervals which only touch at a point are non-overlapping. For example, [1, 2] and [2, 3] are non-overlapping. Constraints 1 <= intervals.length <= 105 intervals[i].length == 2 -5 * 104 <= starti < endi <= 5 * 104 Examples Example 1: Input: intervals = ...