CodingHardcod-g710

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

Question

There are n workers and n tasks. cost[i][j] is the cost of assigning worker i to task j. Each worker does exactly one task and each task is done by exactly one worker. Return the minimum total assignment cost. Use bitmask DP over which tasks are taken. Constraints: 1 <= n <= 14, 0 <= cost[i][j] <= 1000.

Implement

min_assignment(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.