Minimum Window Substring In O(n)

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).

Latest Source Code:
Github: MinimumWindowSubstring.java

Output:

Main String : this is a test string, Search String: tist, Minimum window substring: t stri
Main String : ADOBECODEBANC, Search String: ABC, Minimum window substring: BANC
Main String : A, Search String: A, Minimum window substring: A

Video