Friday, February 10, 2012

Minimum Window in S which Contains All Elements from T

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”.
Posted by at 7:23 PM
Labels: , ,

1 comment:

  1. SudFebruary 10, 2012 at 7:27 PM

    http://www.leetcode.com/2010/11/finding-minimum-window-in-s-which.html

    http://tech-queries.blogspot.in/2010/12/finding-minimum-window-in-array-which.html

    http://www.geeksforgeeks.org/archives/11307

    ReplyDelete

Subscribe to: Post Comments (Atom)