CodingHardcod-g690

Subject Bipartite matchingLevel Senior–Staff~40 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

You must assign n workers to n jobs, one worker per job. cost[i][j] is the cost of assigning worker i to job j. Return the minimum total cost of a complete assignment (a perfect matching). Constraints: 1 <= n <= 80, 0 <= cost[i][j] <= 10^6. A simple greedy or per-row minimum does NOT give the optimum.

Implement

min_assignment_cost(cost: list[list[int]]) → int

Examples

in[[[9,2,7],[6,4,3],[5,8,1]]]out9

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.