Function overlaps

non_overlapping_intervals_435/solution.go:74–82

(intervals [][]int)

}

func overlaps(intervals [][]int) bool {
	for j := 1; j < len(intervals); j++ {
		if intervals[j-1][1] > intervals[j][0] {
			return true
		}
	}

	return false
}

// Initial solution, which failed to recognize that the removal
// order isn't necessarily a part of the start sorted sequence.