Skip to content

Latest commit

 

History

History
11 lines (8 loc) · 348 Bytes

File metadata and controls

11 lines (8 loc) · 348 Bytes

Problem 6: Distributed Anagram Search (Find All Anagrams in a String)

Problem Statement

Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order.

Input Format

  • Two strings s and p.

Example

Input: s = "cbaebabacd", p = "abc"
Output: [0, 6]