Skip to content

Practice Substring with Concatenation of All Words

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#30
LeetCode Problem

Substring with Concatenation of All Words

Hash TableStringSliding Window

Problem Statement

You are given a string s and an array of strings words. All the strings of words are of the same length. A concatenated string is a string that exactly contains all the strings of any permutation of words concatenated. Return an array of the starting indices of all the concatenated substrings in s. You can return the answer in any order.

Source: Substring with Concatenation of All Words on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "barfoothefoobarman", words = ["foo","bar"]
Output
[0,9]

# Example 2

Input
s = "wordgoodgoodgoodbestword", words = ["word","good","best","word"]
Output
[]

# Example 3

Input
s = "barfoofoobarthefoobarman", words = ["bar","foo","the"]
Output
[6,9,12]

Constraints

1 <= s.length <= 10^4
1 <= words.length <= 5000
1 <= words[i].length <= 30
s and words[i] consist of lowercase English letters.

Related LeetCode Problems

Practice more problems similar to Substring with Concatenation of All Words.

3 Longest Substring Without Repeating Characters Medium12 Integer to Roman Medium13 Roman to Integer Easy17 Letter Combinations of a Phone Number Medium1 Two Sum Easy
← Previous Divide Two IntegersNext → Next Permutation

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free