CodingHardcod-g039

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

Question

There are n people and n tasks. cost[i][j] is the cost of assigning person i to task j. Each person must be assigned exactly one task and each task to exactly one person. Return the minimum total assignment cost. Here 1 <= n <= 14 and all costs are non-negative integers.

Implement

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

Examples

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

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.