Create 1235. Maximum Profit in Job Scheduling

Author: rajatag03

1235. Maximum Profit in Job Scheduling

@@ -0,0 +1,23 @@
+class Solution {
+    public int jobScheduling(int[] startTime, int[] endTime, int[] profit) {
+        int n = startTime.length;
+        int[][] jobs = new int[n][3];
+        for(int i=0;i<n;i++){
+            jobs[i] = new int[]{startTime[i],endTime[i],profit[i]};
+        }
+        
+        Arrays.sort(jobs,(a,b) -> a[1] - b[1]);
+        
+        TreeMap<Integer,Integer> dp = new TreeMap<>();
+        dp.put(0,0);
+        
+        for(int[] job:jobs){
+            int val = job[2] + dp.floorEntry(job[0]).getValue();
+            if(val>dp.lastEntry().getValue()){
+                dp.put(job[1],val);
+            }
+        }
+        
+        return dp.lastEntry().getValue();
+    }
+}