Leetcode 1947. Maximum Compatibility Score Sum
Given m students and m mentors each with n-bit binary answer vectors, compute pairwise compatibility scores (count of equal bits) and choose a one-to-one assignment that maximizes the total score. This is a maximum-weight bipartite matching/assignment problem (m, n ≤ 8), often solved by bitmask DP or Hungarian algorithm.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.