Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1820. Maximum Number of Accepted Invitations
Given an n×n boolean matrix where matrix[i][j] indicates whether person i would accept an invitation from person j, compute the largest number of accepted invitations under the constraint that each person can send at most one invitation and accept at most one. This is a maximum bipartite matching problem (solvable with DFS/Hopcroft–Karp or bitmask DP when n is small).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.