next katas
upcoming
- Implement a Trie in scala/java/python
- Monash notes about Tries
- wikipedia Trie
- C++ Trie
- Several different types of Tries
- wikipedia Suffix Tree
- wikipedia Radix Tree
- wikipedia Ternary Search Tree
- placeholder
- #haskell
- placeholder
- Corollary: Answer this careercup question
- How to preprocess dictionary so that these operations are best supported: (1) search (2) given a string find all valid anagrams in a dictionary (3) typing prefix of a valid string suggests valid words
- Learn to implement the porter stemming algo
- Programming Praxis porter stemming part1 part2
- official algorithm page
- porter stemmer in PHP Javascript python
- placeholder
- Learn to implement the Levenshtein distance
- Implement all types of Trees
misc
