Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
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 2744. Find Maximum Number of String Pairs
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source