Maximize Chef Profit with Dish Assignments | Dataford Interview Questions

Given chef expertise (dish each chef can make), chef profit per dish, and a list of dish orders, assign orders to chefs to maximize total profit.

Asked in the onsite coding 2 stage. Solution using TreeMap; similar to Most Profit Assigning Work.

Input and Output

Implement maximize_profit(expertise, profit, orders). expertise[i] is the minimum order difficulty chef i can handle, and profit[i] is that chef's profit for each assigned order. Each order can be assigned independently, and a chef may handle multiple orders. Return the maximum total profit.

Constraints

1 <= len(expertise) == len(profit) <= 5000
1 <= len(orders) <= 5000
0 <= expertise[i], orders[i], profit[i] <= 10^9
Each order is assigned independently
A chef may handle multiple orders

Function Signature

def maximize_profit(expertise, profit, orders):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

Problem

Given chef expertise (dish each chef can make), chef profit per dish, and a list of dish orders, assign orders to chefs to maximize total profit.

Asked in the onsite coding 2 stage. Solution using TreeMap; similar to Most Profit Assigning Work.

Input and Output

Constraints

1 <= len(expertise) == len(profit) <= 5000
1 <= len(orders) <= 5000
0 <= expertise[i], orders[i], profit[i] <= 10^9
Each order is assigned independently
A chef may handle multiple orders

Function Signature

def maximize_profit(expertise, profit, orders):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.