Non-overlapping Intervals

Statement

Given an array of intervals where intervals[i] contains the half-open intervalAn interval that contains only one of its boundary elements. The “(” parenthesis denotes the exclusion of the starting point. The “]” bracket denotes the inclusion of the ending point., $(start_{i}​, end_{i}]$, your task is to find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

Note: Two intervals $(a, b]$ and $(c,d]$ ...