Leetcode Problem 1335. Minimum Difficulty of a Job Schedule

1335. Minimum Difficulty of a Job Schedule

Leetcode Solutions

Define the state min_diff(i, d) representing the minimum difficulty starting from job i with d days left.
If d is 1, return the maximum difficulty of jobs from i to the end.
If i is equal to the length of the job array, return 0 if d is 0, or -1 otherwise.
Iterate over all possible job indices j from i to the end, and for each j, calculate the difficulty of scheduling jobs from i to j on the current day and add it to the result of min_diff(j, d - 1).
Use memoization to store and reuse the results of subproblems.
Return the minimum difficulty found for scheduling jobs from i with d days left.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen