Hi guys, How can we do this efficiently:
Given a string S. Find all the sub-sequence strings that are of length K. For example, given "abcd", and lenght k = 3, we will have: abc, abd, acd, bcd. Thanks a lot. :-) --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
