Problem: Find All Anagrams in a String

Medium

30 min

Explore how to identify all starting indexes of anagrams of a string b within another string a by efficiently tracking character frequencies. This lesson helps you understand the problem, use frequency maps, and implement a solution that handles permutations and anagram checks, preparing you to solve similar coding interview challenges.

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\leq$ a.length, b.length $\leq 10^3$
Both a and b consist only of lowercase English letters.

Problem: Find All Anagrams in a String

Medium

30 min

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\leq$ a.length, b.length $\leq 10^3$
Both a and b consist only of lowercase English letters.

Problem: Find All Anagrams in a String

Statement

Examples

Understand the problem

Figure it out

Try it yourself

Problem: Find All Anagrams in a String

Statement

Examples

Understand the problem

Figure it out

Try it yourself