A simple solution is to one by one consider all substrings of first string and for every substring check if it is a substring in second string. Keep track of the maximum length substring. There will ...

Given two strings s and t, find the minimum window substring in s that contains all the characters of t in any order. If there is no such substring, return an empty string "". Explanation: Use a ...