← Paytm questions

Maximum bipartite matching of children to liked toys

Filed under Paytm

Given a binary matrix where matrix[i][j] = 1 means child i likes toy j, find the maximum number of children who can be assigned a unique toy they like.

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 Paytm questions

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