Longest common subsequence
Min cost path

Dynamic Programming
Tree Operations

1. Check BST validity
2. Print BST as BFS
3. Trie search and insert