← Samsung questions

Maximum bipartite matching of children to toys

Filed under Samsung

Given a set of N children and M toys, and a preference matrix where matrix[i][j] = 1 indicates child i likes toy j. Each child can be assigned at most one toy, and each toy can be assigned to at most…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Samsung questions

Collected from public candidate posts and coding forums. Updated Nov 2026.