leetcode和oj-interviewprep:面试准备

leetcode 和 oj 完整的面试准备文档 - 基于 GooglePrep.txt 推荐书籍 编程面试曝光：找到下一份工作的秘密，John Mongan、Eric Giguere、Noah Suojanen、Noah Kindler、John Wiley & Sons 算法导论，Thomas H. Cormen 破解编码面试，Gayle Laakmann McDowell 建议问题解决实践网站 推荐视频 建议教程 排序 - Quick Sort Merge Sort Heap Sort Trade-off 哈希表及其实现 树木 binary trees n-ary trees trie-trees traversal balanced binary tree, red/black tree splay tree AVL tree Implementation 图表 There are 3 basic ways to represent a graph in memory (objects and pointers, matrix, and adjacency list) B