Available question text
Partition a list of indivisible jobs (each with a duration) among a fixed number of workers to minimize the maximum workload (makespan) any worker gets. This is a combinatorial partitioning/ scheduling problem typically solved by checking feasibility for a candidate makespan (via backtracking with pruning or subset-bitmask DP) and binary-searching the minimum feasible time.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
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 2323. Find Minimum Time to Finish All Jobs II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source