2406. Divide Intervals Into Minimum Number of Groups
2406. Divide Intervals Into Minimum Number of Groups Difficulty: Medium Topics: Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum You are given a 2D integer array intervals where intervals[i] = [lefti, righti] represents the inclusive interval [lefti, righti]. You have to divide the intervals into one or more groups such that each interval…