Tags

,

Uhh, that one was pretty tough! Enjoy it! 😀

Minimum window in String 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)

For example:

S = "ADOBECODEBANC"
T = "ABC"

Minimum window is "BANC"

As usual a post with a solution will follow.. stay tuned! 😉

Advertisements