Untitled

class Solution {
    public int removeCoveredIntervals(int[][] intervals) {
        Arrays.sort(intervals,(a,b)->a[0]==b[0]?b[1]-a[1]:a[0]-b[0]);
        int[] prev = intervals[0];
        int cnt = 0;
        for(int i=1;i<intervals.length;i++)
        {
              int[] cur   =  intervals[i];
              int st =  cur[0];
              int et =  cur[1];
              if(prev[0]<=st && prev[1]>=et)
                  cnt++;
              else 
                  prev = cur;
        }
        return intervals.length - cnt;
    }
}