Solution to this might be a Trie. A trie is a tree with multiple children, but each children is referred by a keyword (used for searching). you break a string into parts and make a Trie out of it. This way searching for a string will be optimized.
I am working on how to access counts efficiently. Hope somebody comes up with a better solution soon. -- 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/-/e_1Pr9nRaAAJ. 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.
