面经网

原帖地址：一亩三分地

1. word ladder 1, return one shortest path
2. combination sum, merge K sorted list
3. print company organization: given a file in which every line has a name, id, and boss id. print this graph. Design a web crawler
4. longest increasing subsequence