Assign n workers to n tasks, one each, minimising total cost. Trying all n! permutations is hopeless beyond n ≈ 10, but bitmask DP solves it in O(n² · 2ⁿ):
Unlock this and every premium problem across all tracks — plus hidden-test grading, advanced AI engineering modules and new content every week.
Start 7-day free trial