CodingHardcod-g264

Subject Bitmask dpLevel Senior–Staff~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

There are n workers and n jobs; cost[i][j] is the cost of assigning worker i to job j. Assign each worker exactly one distinct job to minimize total cost. Return the minimum total cost. 1 <= n <= 12, 0 <= cost[i][j] <= 10^5.

Implement

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

Examples

in[[[9,2],[3,4]]]out5

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.