Coding (Algo)

Maximize Compatible Assignments

Algorithm: Bipartite matching Difficulty: Hard Time: 45 minutes

Goal

Return the largest number of compatible pairs such that no left item or right reviewer is used more than once.

What this task practices

Maximize Compatible Assignments 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.