Leetcode 1335. Minimum Difficulty of a Job Schedule

Partition the ordered list of jobs into d contiguous days (at least one job per day) to minimize the sum of daily difficulties, where each day's difficulty is the maximum jobDifficulty in that segment. Return -1 if there are fewer jobs than days; constraints: n ≤ 300, d ≤ 10.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1335. Minimum Difficulty of a Job Schedule

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact