Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2323. Find Minimum Time to Finish All Jobs II
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.