Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1595. Minimum Cost to Connect Two Groups of Points
Select edges in a bipartite graph (given by a cost matrix) so every vertex in both groups is connected to at least one opposite vertex and the total cost is minimized. With sizes ≤12 and unlimited degree, this is typically solved by bitmask DP over the smaller group to track which second-group points are already covered.
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.