Minimum Difficulty of a Job Schedule
You want to schedule a list of jobs in d days. Jobs are dependent so you have to finish all jobs from index 0 to i before working on job i+1. Each day you must work on at least one job. The difficulty of a day is the maximum difficulty of a job done that day. Return the minimum sum of difficulties of each day.
Minimum Difficulty of a Job Schedule

You want to schedule a list of jobs in d days. Jobs are dependent so you have to finish all jobs from index 0 to i before working on job i+1. Each day you must work on at least one job. The difficulty of a day is the maximum difficulty of a job done that day. Return the minimum sum of difficulties of each day.

Example 1:
Input: {"jobDifficulty":[6,5,4,3,2,1],"d":2}
Output: 7
Input
arr ={"jobDifficulty":[6,5,4,3,2,1],"d":2}

Jobs: [6, 5, 4, 3, 2, 1], Days: 2

State
jobs
[6, 5, 4, 3, 2, 1]
days
2
Variables
No variables to display
DepthFunction Call
Stack empty
0/1