C类型题:
76 最小覆盖子串 (slide windows)
632 最小区间 (slide windows)
734 网络延迟时间 (graph - shortest path)
207 课程表(graph - cycle detect)
210 课程表II(graph - topological sort DFS or BFS)
444. Sequence Reconstruction (graph - topological sort BFS)
164. 最大间距(bucket sort--- gap = (max - min) / (n - 1) )
B类型题:
30 串联所有单词的子串 (slide windows)