Scribbling

A solution using sliding window. class Solution: def findSubstring(self, s: str, words: List[str]) -> List[int]: from collections import Counter ret = [] wordSet = set(words) n, m = len(words), len(words[0]) for i in range(m): wordCounter = Counter(words) k = j = i while j + m = n * m: if s[k:k+m] in wordSet: wordCounter[s[k:k+m]] += 1 k += m word = s[j:j+m] if word in wordSet: wordCounter[word]..

O(NK)... from collections import deque, defaultdict class Solution: def findSubstring(self, s: str, words: List[str]) -> List[int]: n = len(s) m = len(words) len_words = len(words[0]) if n < m * len_words: return [] ret = set() ans = defaultdict(int) for word in words: ans[word] += 1 words = set(words) for i in range(0, len_words): comp = defaultdict(int) q = deque([], maxlen=m) while i