← Questions
Substring with concatenation of all words
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a string and a list of words of equal length, return every start index where a substring is some concatenation of all the words, each used exactly once. Use a sliding window over word-sized steps.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding