Time: 52 ms (23.8%), Space: 73.7 MB (42.5%) - LeetHub

Author: Vivekchavda1374

0435-non-overlapping-intervals/0435-non-overlapping-intervals.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int eraseOverlapIntervals(int[][] intervals) {;
+        Arrays.sort(intervals,(a,b)->a[1]-b[1]);
+        Stack<int[]> stk = new Stack<>();
+        int res=0;
+        for(int[] i : intervals){
+            if(!stk.isEmpty() && i[0]< stk.peek()[1]){
+                res++;
+            }else{
+                stk.push(i);
+            }
+        }
+
+    return res;
+    }
+}