Hard
Quiz
#30 Substring with Concatenation of All Words
APPROACH
All strings in array words have equal length. A valid starting index in s is one where the substring of appropriate total length contains each word in words exactly the required number of times (in any order). Return all such starting indices in any order.
1 of 4
1:00
What is the optimal approach for this problem?