//2.Search for all possible divisor of str.length, starting for length/2 //3.If i is a divisor of length, repeat the substring from 0 to i the number of times i is contained in s.length //4.If the ...

Given two strings s and t, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If no such substring exists, return "". "BANC" is ...