2580. Count Ways to Group Overlapping Ranges

You are given a 2D integer array ranges where ranges[i] = [starti, endi] denotes that all integers between starti and endi (both inclusive) are contained in the ith range. You are to split ranges into two (possibly empty) groups such that: - Each range belongs to exactly one group. - Any two overlapping ranges must belong to the same group. Two ranges are said to be overlapping if there exists