Available question text
Count the number of equivalence classes of strings under the relation that allows arbitrary swaps among even indices and among odd indices. Key idea: each string's invariant is the multiset (or sorted sequence) of its even-indexed characters and of its odd-indexed characters — strings with the same pair form are special-equivalent.
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 893. Groups of Special-Equivalent Strings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source