Ezvor
Interview prep & careers
Practice
Home
Problems
Study Lists
Progress
Leaderboard
Compiler
Career
Readiness
Roadmaps
Opportunities
Resources
AI Advisor
0
day streak
0
solved
Settings
Sign in
Toggle Sidebar
Ezvor
Interview prep & careers
Problem List
Run
Submit
Interview
Interview mode
0
00:00
Description
Editorial
Solutions
AI Coach
Submissions
Notes
2323. Find Minimum Time to Finish All Jobs II
Medium
Array
Preparing judge…
LeetCode
Array
Greedy
Sorting
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.
Preparing judge…
Testcase
Test Result
Case 1
Input