Hey tye!
I read some things on suffix and prefix trees, but didn't get very far. Still, your solution looks really good when dealing with a large number of strings. Fortunately I won't have to deal with that many :)
It's not homework, it's to help me on my job, but thanks for the guidance!
In reply to Re^2: longest common substring (with needed tweaks) (trie)
by R56
in thread longest common substring (with needed tweaks)
by R56
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |