public int removeCoveredIntervals(int[][] intervals) {


        Arrays.sort(intervals, (a,b) -> a[0] - b[0] == 0 ? b[1] - a[1] : a[0] - b[0]) ;

        int ans = 0;

        int i = 0;

        while (i < intervals.length)
        {
            int j = i;

            while (j < intervals.length && intervals[i][0] <= intervals[j][0] && intervals[i][1] >= intervals[j][1]) j++;



            ans++;
            i = j;

        }



        return ans;
    }