Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C#

Solution: Find All Anagrams in a String

Explore how to identify all starting indices of anagrams of one string within another by using sliding window and hash map counters in C#. This lesson helps you understand tracking character counts and implementing an efficient solution with linear time complexity.

We'll cover the following...

Statement

Given two strings, a and b, return an array of all the start indexes of anagrams of b in a. We may return the answer in any order.

An anagram is a word or phrase created by rearranging the letters of another word or phrase while utilizing each of the original letters exactly once. For example, “act” is the anagram of “cat”, and “flow” is the anagram of “wolf”.

Constraints:

  • 1≤1\leq a.Length, b.Length ≤3×103\leq 3 \times 10^3
...