Combination Sum III
Kth Largest Element in an Array
Shortest Palindrome How to do it with KMP?
House Robber II The trick is to find the max value between robbing 0 to n-2 and 1 to n-1, so that we avoid the rounding issue.
Word Search II Backtracking + Trie.
Add and Search Word – Data structure design
Course Schedule II Topological sort.
Minimum Size Subarray Sum
Implement Trie (Prefix Tree)