Find all anagram start indices

Q: Find all anagram start indices

This is a Coding & Algorithms interview question from Databricks for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Problem

Given two strings s and p, return all starting indices of substrings in s that are anagrams (permutations) of p.

Input

s : string
p : string

Output

A list of integers: all start indices i such that s[i : i+len(p)] is an anagram of p .
Indices should be returned in increasing order.

Notes

Treat strings as lowercase English letters unless otherwise specified.

Example

s = "cbaebabacd" , p = "abc"
Output: [0, 6]
- s[0:3] = "cba" is an anagram of "abc"
- s[6:9] = "bac" is an anagram of "abc"

Constraints

1 <= |s|, |p| <= 3 * 10^4 (or similar interview-scale bounds).