Non-overlapping Intervals LeetCode 435. Non-overlapping Intervals Solutions Sort the intervals by right limit. Loop from left, remove next if it overlaps with current interval. This is to ensure that the removed interval is “largest” interval. PREVIOUSInvert Binary TreeNEXTConstraint Satisfication Problems