Available question text
Find the length of the longest pair of perfect anagrams from the substrings of a given string. Perfect anagrams are defined as words with equal letter counts but different arrangements. For example, given s = 'abcacb', the longest pair is ('bcac', 'cacb') with length 4. Constraint: 1 <= len(s) <= 10^5.
Related questions
Continue with questions that share topics or the same question type.
- Find the Length of the Longest Common Prefix
Coding
- Find All Anagrams in a String
Coding · Hash Table · Sliding Window · String
- Find K-Length Substrings With No Repeated Characters
Coding
- Find K-th Smallest Pair Distance
Coding
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
Amazon
Find the Length of the Longest Pair of Perfect Anagrams
Reported Oct 5, 2024 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source