Non-overlapping Intervals LeetCode solution in JavaScript

1
var eraseOverlapIntervals = function (intervals) {
2
  // sort by end's small to big
3
  intervals.sort((a, b) => a[1] - b[1]);
4

5
  let total = 1;
6
  let maxEnd = intervals[0][1];
7

8
  for (let i = 1; i < intervals.length; i++) {
9
    let [start, end] = intervals[i];
10
    if (start >= maxEnd) {
11
      total++;
12
      maxEnd = end;
13
    }
14
  }
15

16
  return intervals.length - total;
17
};