Longest Common Anagram Substring in Two Strings
Given two strings, find the longest substring (contiguous or by character multiset) that appears as an anagram in both strings — i.e., both strings contain a substring of the same length with identical character frequencies. Return the length of this longest common anagram substring, or the substring itself.
Asked at:
Navan
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late October, 2025
Navan
Senior
Hello Interview Premium
Your account is free and you can post anonymously if you choose.