Leetcode 1723. Find Minimum Time to Finish All Jobs
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.
Asked at:
NVIDIA
Snowflake
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Early January, 2026
NVIDIA
Senior
Late January, 2025
Snowflake
Mid-level
Given an array of [id, testTime] where testTime = time take to run the test `id`, and an integer n that represents max number of times allowed on all machines, return all Ids per machine where a minimum number of machines are used to finish all the tests. ex) input: [[1, 10], [2, 30], [3, 60], [4, 15]], n = 60 output: [[3], [2, 1, 4]]
Hello Interview Premium
Your account is free and you can post anonymously if you choose.