#1830Hard· asked at 6 companies
Substring with Concatenation of All Words
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: s = "barfoothefoobarman", words = ["foo","bar"] Output: [0,9]
"barfoo" starts at 0 and "foobar" starts at 9.
Example 2
Input: s = "wordgoodgoodgoodbestword", words = ["word","good","best","word"] Output: []
Constraints
- •
1 <= s.length <= 10^4 - •
1 <= words.length <= 5000 - •
1 <= words[i].length <= 30 - •
All words have the same length.