โ† Microsoft questions

Find anagram substring of s2 in s1 in O(n)

Filed under Microsoft

Given two strings s1 and s2, determine if s1 contains any continuous substring that is an anagram of s2 in O(n) time.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.