Hi, On Aug 7, 11:52 pm, "mohamad momenian" <[EMAIL PROTECTED]> wrote: > Hi > > this is the problem : Is this some assignment for the group?
> How many strings with length "N" that contains Only "0" and "1" exist that > not contains a specific pattern with length "K" > input is " a string with length k" and "k" and "N" . Have you made any attempts? Please post something like your own algorithm while asking questions. These groups are not for people to help you complete your homework. > thanks and Good luck ;) For what?? There are a lot of algorithms for partial string match that you can find on googling. The string containing 0 & 1 is just a special case. I don't see why any of the general algorithms won't work here. Try Knuth-Morris-Pratt. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
