Minimum Difficulty of a Job Schedule: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

Maximum Profit in Job Scheduling
Coding · Array · Binary Search · Dynamic Programming
Minimum Number of Refueling Stops
Coding · Array · Dynamic Programming · Greedy
Minimum Path Sum
Coding · Array · Dynamic Programming · Matrix
Beautiful Arrangement
Coding · Array · Backtracking · Bit Manipulation

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 1335. Minimum Difficulty of a Job Schedule
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 3 records

Atlassian
Minimum Difficulty of a Job Schedule
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source
Atlassian
Minimum Difficulty of a Job Schedule
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source
Microsoft
Minimum Difficulty of a Job Schedule

Minimum Difficulty of a Job Schedule

Available question text

Related questions

Minimum Difficulty of a Job Schedule

Available question text

Related questions