Given two strings. Find the smallest window in the first string consisting of all the characters of the second string.
Input: S = timetopractice P = toc Output: toprac Explanation: toprac is the smallest subset in which toc can be found.
Input: S = zoomlazapzo P = oza Output: apzo Explanation: To find oza in the zoomlazapzo the smallest subset is apzo.
You don't need to read input or print anything. Your task is to complete the function smallestWindow() which takes two string S and P as inputs and returns the smallest window in string S having all the characters of the string P. In case there are multiple such windows of same length, return the one with the least starting index. Return "-1" in case there's no such window present.
Expected Time Complexity: O(|S|)
Expected Auxiliary Space: O(1)
1 <= |S|, |P| <= 1000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes