You are given a string, S, and a list of words, L, that are all of the same lengths.
Find all starting indices of substring(s)
in S
that is a concatenation of each word in L
exactly once and without any intervening characters.
Example :
S: "barfoothefoobarman"
L: ["foo", "bar"]
Your output should be [0,9]
where order does not matter.
Your Input:
S : "domecodehaha"
L : ["haha","code"]