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.