you can use longest common subsequence algorithm to solve it. http://codepad.org/NDAeIpxR
On Sun, Jul 11, 2010 at 9:32 AM, amit <amitjaspal...@gmail.com> wrote: > 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) . > > Constraint : The characters may appear in any order > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
