Substring with Concatenation of All Words · Coding Interview Practice

Substring with Concatenation of All WordsGiven a string s and an array of words that all have the same length, return the starting indices of every substring of s that is a concatenation of each word exactly once, in any order, with no characters between them.Constraints

1 <= s.length <= 10^4

1 <= words.length <= 5000

All words have the same length, between 1 and 30

Examples

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

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

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…