Most Profit Assigning Work

MediumGreedytwo pointers

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

There are n jobs: job i has difficulty difficulty[i] and pays profit[i]. There are also m workers, and worker j can only do a job whose difficulty is at most worker[j]. Each worker does at most one job, but the same job can be done by any number of workers, each earning its profit. A worker who can do no job earns 0. Return the maximum total profit the workers can earn.

Examples

Input: difficulty = [2,4,6,8,10], profit = [10,20,30,40,50], worker = [4,5,6,7]
Output: 100
The workers take jobs of difficulty 4, 4, 6, 6 and earn `20 + 20 + 30 + 30`.
Input: difficulty = [85,47,57], profit = [24,66,99], worker = [40,25,25]
Output: 0
Every job is too hard for every worker.

Constraints

  • `n == difficulty.length == profit.length`
  • `m == worker.length`
  • `1 <= n, m <= 10^4`
  • `1 <= difficulty[i], profit[i], worker[j] <= 10^5`

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More two pointers problems