Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Sum Score of Array
Coding
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Choose K Elements With Maximum Sum
Coding
- Difference Between Maximum and Minimum Price Sum
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1947. Maximum Compatibility Score Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source