Any idea about results ? On Jul 26, 4:20 pm, Mukul Gupta <[email protected]> wrote: > here is one good tutorial on > topcoderhttp://www.topcoder.com/tc?module=Static&d1=tutorials&d2=usingTries May > be > this can help you. > > > > > > > > On Sun, Jul 24, 2011 at 3:51 AM, Akash Mukherjee <[email protected]> wrote: > > sorry if it seems to be off the topic, but any good resources for trie > > for a newbie?? > > > thanks :) > > > On Sat, Jul 23, 2011 at 11:02 PM, varun pahwa <[email protected]> > > wrote: > > > Use trie tree and store word count also along with the pointer. So, that > > > search could take at max word size time. > > > > On Sat, Jul 23, 2011 at 10:4 4 PM, rajeev bharshetty < > > [email protected]> > > > wrote: > > > >> Trie data structure can be used ? What you say guys?? > > > >> On Sat, Jul 23, 2011 at 10:43 PM, ankit sambyal <[email protected] > > > >> wrote: > > > >>> Use hashing with the words as key. Store the string of the word as the > > >>> value.. > > > >>> -- > > >>> You received this message because you are subscribed to the Google > > Groups > > >>> "Algorithm Geeks" group. > > >>> To post to this group, send email to [email protected]. > > >>> To unsubscribe from this group, send email to > > >>> [email protected]. > > >>> For more options, visit this group at > > >>>http://groups.google.com/group/algogeeks?hl=en. > > > >> -- > > >> Regards > > >> Rajeev N B > > > >> -- > > >> You received this message because you are subscribed to the Google > > Groups > > >> "Algorithm Geeks" group. > > >> To post to this group, send email to [email protected]. > > >> To unsubscribe from this group, send email to > > >> [email protected]. > > >> For more options, visit this group at > > >>http://groups.google.com/group/algogeeks?hl=en. > > > > -- > > > Varun Pahwa > > > B.Tech (IT) > > > 7th Sem. > > > Indian Institute of Information Technology Allahabad. > > > Ph : 09793899112 > > > Official Email :: [email protected] > > > Another Email :: [email protected] > > > > People who fail to plan are those who plan to fail. > > > > -- > > > You received this message because you are subscribed to the Google Groups > > > "Algorithm Geeks" group. > > > To post to this group, send email to [email protected]. > > > To unsubscribe from this group, send email to > > > [email protected]. > > > 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 [email protected]. > > To unsubscribe from this group, send email to > > [email protected]. > > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
