Back

2458. Find Minimum Time to Finish All Jobs II

Medium
Array
Greedy
Sorting
Solve on LeetCode View Solutions

Description

Hints

Hint 1
It is always optimal to pair the worker with the least amount of time with the job that requires the least amount of time.
Hint 2
Sort both arrays.

Similar Questions

Task Scheduler
Medium
Find Minimum Time to Finish All Jobs
Hard
Minimum Number of Work Sessions to Finish the Tasks
Medium

Statistics

Acceptance
65.9%
Submissions
18,915
Accepted
12,470