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.