Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3476. Maximize Profit from Task Assignment
Given arrays of task difficulties and corresponding profits plus worker abilities, assign at most one task to each worker (a worker can do any task with difficulty ≤ their ability) — tasks may be reused by multiple workers — to maximize the total profit. The core challenge is mapping each worker ability to the best achievable profit (commonly solved by sorting tasks and workers and maintaining a running maximum).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.