Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Perfect Assignment > Editorial

Perfect Assignment — Solution & Editorial

Back to the Problem

Bitmask DP over assigned tasks: dp[mask] = min cost to assign the first popcount(mask) workers to the tasks in mask. (Hungarian algorithm scales to N = 500, but bitmask is enough here.)

Complexity: O(2N · N)