Leetcode 2406. Divide Intervals Into Minimum Number of Groups

Partition the given intervals into the minimum number of groups so that no two intervals in a group overlap. This is equivalent to finding the maximum number of intervals that overlap at any point (the interval graph's clique number), which determines the required number of groups.