Maximum Profit in Job Scheduling
We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. Return the maximum profit you can take such that there are no two jobs with overlapping time ranges.
Maximum Profit in Job Scheduling

We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. Return the maximum profit you can take such that there are no two jobs with overlapping time ranges.

Example 1:
Input: {"startTime":[1,2,3,3],"endTime":[3,4,5,6],"profit":[50,10,40,70]}
Output: 120
Input
arr ={"startTime":[1,2,3,3],"endTime":[3,4,5,6],"profit":[50,10,40,70]}

Given 4 jobs. Sort by start time.

State
jobs
["[1, 3] profit=50", "[2, 4] profit=10", "[3, 5] profit=40", "[3, 6] profit=70"]
Variables
No variables to display
DepthFunction Call
Stack empty
0/5