Finding the Minimum Window in S which Contains All Elements from T | LeetCode Given a set T of characters...

Please Visit: http://ift.tt/1ajReyV

Finding the Minimum Window in S which Contains All Elements from T | LeetCode



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

eg,

S = “ADOBECODEBANC”

T = “ABC”

Minimum window is “BANC”.

http://ift.tt/1lXrB1P

http://ift.tt/1o5yTiR

Finding the Minimum Window in S which Contains All Elements from T | LeetCode

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1lXrB1R

via LifeLong Community