Available question text
Partition 4n tasks into n groups of four and assign each group to a processor so as to minimize the makespan, where a processor's completion time is its availability time plus the largest task duration in its assigned group. Return the minimum possible maximum completion time across all processors.
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 2895. Minimum Processing Time
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source