Algorithm: Bipartite matching Difficulty: Hard Time: 65 minutes
Goal
Return the maximum number of jobs that can run at once with one job per worker.
Coding (Algo)
Algorithm: Bipartite matching Difficulty: Hard Time: 65 minutes
Return the maximum number of jobs that can run at once with one job per worker.
Compatible Worker Assignment is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as hard difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.