Available question text
Partition the given job times into k worker workloads so that the maximum sum assigned to any worker is as small as possible — a balanced k-way partitioning problem. With n ≤ 12 this is typically solved by exhaustive search/bitmask DP with strong pruning or by binary-searching the answer and checking feasibility via DFS.
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 · 2 records
NVIDIA
Leetcode 1723. Find Minimum Time to Finish All Jobs
Reported Jan 2, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceSnowflake
Leetcode 1723. Find Minimum Time to Finish All Jobs
Reported Jan 24, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source