Leetcode 3664. Two-Letter Card Game

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3664. Two-Letter Card Game

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact