Available question text
Given a list of two-letter cards and a target letter x, repeatedly remove disjoint pairs of cards that both contain x and differ in exactly one position; return the maximum number of such pairs. The core challenge is to pair up cards containing x (strings of length 2) to maximize disjoint compatible pairs — equivalent to finding a maximum matching in the compatibility graph defined by Hamming distance 1.
Related questions
Continue with questions that share topics or the same question type.
- Card Flipping Game
Coding
- Implement a UI Card Game That Deals Cards
Coding
- Longest Palindrome by Concatenating Two Letter Words
Coding
- Simulate a Turn-Based Two-Player Game
Coding · Low-Level Design (OOP) · Simulation & State Machines
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 3664. Two-Letter Card Game
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source