Search
⌘K
Leetcode 2744. Find Maximum Number of String Pairs
Given an array of distinct two-letter strings, compute the maximum number of disjoint pairs (i < j) such that one string equals the reverse of the other, with each string used at most once.
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.