Assign tasks minimum cost
You must assign n tasks to n workers, one task each. cost[i][j] is the cost of giving task i to worker j. Assign every task so total cost is minimized, and return that minimum. Constraints: 1 <= n <= 16, 0 <= cost[i][j] <= 1000.
Implement
min_assignment_cost(cost: list[list[int]]) → intExamples
in
[[[9,11,14],[6,15,13],[11,8,10]]]out27What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
[[[9,11,14],[6,15,13],[11,8,10]]]27not run yetsample