j****i
发帖数: 4 | 1 1.算法
linkedlist https://leetcode.com/tag/linked-list/
2 pointer https://leetcode.com/tag/two-pointers/，或是一头一尾，或是分布于
两个数据结构)
divide and conquer https://leetcode.com/tag/divide-and-conquer/，最典型的就
是merge sort)
greedy http://geeksquiz.com/algorithms/greedy-algorithms/，最典型的就是Schedule Activity / Job sequence / Meeting rooms)
recursion and DP https://leetcode.com/tag/dynamic-programming/，最典型的就
是｛Longest / Maximum / Target / Largest / Minimum / Most｝ + ｛subX /
Matrix / Tree / Path｝)
back tracking https://leetcode.com/tag/backtracking/，真的找不到很好的方法
时，才会用它)
string https://leetcode.com/tag/string/，leetcode还是蛮全的)
tree (最典型的就是BFS, DFS, inoder, preorder, postorder, recursive traversal
， iterative traversal, 求path，binary search tree, heap, trie，Minimum
spanning tree，题目参看leetcode)
graph (DFS, Topological Sorting, Shortest path)
bit https://leetcode.com/tag/bit-manipulation/
math https://leetcode.com/tag/math/
2. 系统设计总结
相对算法题而言系统设计题更像送分题，当然前提是你得跟着面试官的问题走，不要不
顾面试官的想法自己横冲直撞。我这方面比较薄弱，大家可以参考版上的其他帖子。
3. 有用的url
leetcode
geeksforgeeks
算法题分类总结：http://www.mitbbs.co.nz/article_t/JobHunting/32564237.html
leetcode解法：http://www.cnblogs.com/higerzhang/category/617733.html
编程之法：面试和算法心得：https://github.com/julycoding/The-Art-Of-
Programming-By-July/blob/master/ebook/zh/00.01.md
详细的面试总结：https://www.evernote.com/shard/s576/sh/7e58b450-1abe-43a8-
bf82-fbf07f1db13c/049802174415b418a2e65f75b744ab72
系统设计总结：https://sites.google.com/site/careerofpsyclaudezintheus/
company/design | w********p
发帖数: 948 | | j**********m
发帖数: 51 | | t******i
发帖数: 483 | | g*****c
发帖数: 106 | | l**o
发帖数: 356 | | c**********y
发帖数: 20 | |
|
