Q2 can be done using KMP algo or suffix tree On Sun, Apr 1, 2012 at 1:12 PM, Decipher <ankurseth...@gmail.com> wrote:
> Q1) Yes, as per my friend the only interface is that function. But how > will you traverse the matrix because if : BADCAT is one row then there are > two words BAD and CAT and you have to find both and it could be DAB and TAC > also ? > > Q2) What will be the complexity when state machine is used ? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/RIgd-ITxYDEJ. > > To post to this group, send email to algogeeks@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. > -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.