http://codepad.org/NDAeIpxR <http://codepad.org/NDAeIpxR>Here is code for it
On Sat, Jun 26, 2010 at 9:54 PM, Anand <anandut2...@gmail.com> wrote: > you can use Longest common subsequence algorithm to solve it. > > > > On Sat, Jun 26, 2010 at 4:04 PM, amit <amitjaspal...@gmail.com> wrote: > >> You r given a large string of characters lets call it Sbig. Then there >> is a small set of characters lets call it Ssmall. You have to find >> smallest substring of Sbig which contains all characters in Ssmall. >> >> For example you are given Sbig = "hello what are you doing" >> Ssmall= "eo" >> >> answer is "ello" >> 24 >> >> -- >> 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.
