这种东西要做梦都梦到 min/max heap
bucket sort
topological sort
binary tree preorder/inorder/postorder traversal
binary tree level traversal BFS
binary tree vertical order traversal
combination/permutation
最终我觉得像下面的，这种题要达到闭眼秒杀的程度One shot
word search 1
word search 2
word break 1
word break 2
word ladder 1
word ladder 2
LIS
LRU
sort color
insert & delete in O1
rob house 1
rob house 2
rob house 3
2 sum
3 sum
4 sum
No comments:
Post a Comment