├── .gitignore ├── LICENSE.txt ├── README-cn.md ├── README.md ├── extras ├── cheat sheets │ ├── C Reference Card (ANSI) 2.2.pdf │ ├── Cpp_reference.pdf │ ├── STL Quick Reference 1.29.pdf │ ├── bits-cheat-cheet.pdf │ ├── python-cheat-sheet-v1.pdf │ └── system-design.pdf ├── future-googler-preview.png └── future-googler.pdf └── programming-language-resources.md /.gitignore: -------------------------------------------------------------------------------- 1 | .idea 2 | personal-9894.md 3 | -------------------------------------------------------------------------------- /LICENSE.txt: -------------------------------------------------------------------------------- 1 | Attribution-ShareAlike 4.0 International 2 | 3 | ======================================================================= 4 | 5 | Creative Commons Corporation ("Creative Commons") is not a law firm and 6 | does not provide legal services or legal advice. Distribution of 7 | Creative Commons public licenses does not create a lawyer-client or 8 | other relationship. Creative Commons makes its licenses and related 9 | information available on an "as-is" basis. Creative Commons gives no 10 | warranties regarding its licenses, any material licensed under their 11 | terms and conditions, or any related information. Creative Commons 12 | disclaims all liability for damages resulting from their use to the 13 | fullest extent possible. 14 | 15 | Using Creative Commons Public Licenses 16 | 17 | Creative Commons public licenses provide a standard set of terms and 18 | conditions that creators and other rights holders may use to share 19 | original works of authorship and other material subject to copyright 20 | and certain other rights specified in the public license below. The 21 | following considerations are for informational purposes only, are not 22 | exhaustive, and do not form part of our licenses. 23 | 24 | Considerations for licensors: Our public licenses are 25 | intended for use by those authorized to give the public 26 | permission to use material in ways otherwise restricted by 27 | copyright and certain other rights. Our licenses are 28 | irrevocable. Licensors should read and understand the terms 29 | and conditions of the license they choose before applying it. 30 | Licensors should also secure all rights necessary before 31 | applying our licenses so that the public can reuse the 32 | material as expected. Licensors should clearly mark any 33 | material not subject to the license. This includes other CC- 34 | licensed material, or material used under an exception or 35 | limitation to copyright. More considerations for licensors: 36 | wiki.creativecommons.org/Considerations_for_licensors 37 | 38 | Considerations for the public: By using one of our public 39 | licenses, a licensor grants the public permission to use the 40 | licensed material under specified terms and conditions. If 41 | the licensor's permission is not necessary for any reason--for 42 | example, because of any applicable exception or limitation to 43 | copyright--then that use is not regulated by the license. Our 44 | licenses grant only permissions under copyright and certain 45 | other rights that a licensor has authority to grant. Use of 46 | the licensed material may still be restricted for other 47 | reasons, including because others have copyright or other 48 | rights in the material. A licensor may make special requests, 49 | such as asking that all changes be marked or described. 50 | Although not required by our licenses, you are encouraged to 51 | respect those requests where reasonable. More_considerations 52 | for the public: 53 | wiki.creativecommons.org/Considerations_for_licensees 54 | 55 | ======================================================================= 56 | 57 | Creative Commons Attribution-ShareAlike 4.0 International Public 58 | License 59 | 60 | By exercising the Licensed Rights (defined below), You accept and agree 61 | to be bound by the terms and conditions of this Creative Commons 62 | Attribution-ShareAlike 4.0 International Public License ("Public 63 | License"). To the extent this Public License may be interpreted as a 64 | contract, You are granted the Licensed Rights in consideration of Your 65 | acceptance of these terms and conditions, and the Licensor grants You 66 | such rights in consideration of benefits the Licensor receives from 67 | making the Licensed Material available under these terms and 68 | conditions. 69 | 70 | 71 | Section 1 -- Definitions. 72 | 73 | a. Adapted Material means material subject to Copyright and Similar 74 | Rights that is derived from or based upon the Licensed Material 75 | and in which the Licensed Material is translated, altered, 76 | arranged, transformed, or otherwise modified in a manner requiring 77 | permission under the Copyright and Similar Rights held by the 78 | Licensor. For purposes of this Public License, where the Licensed 79 | Material is a musical work, performance, or sound recording, 80 | Adapted Material is always produced where the Licensed Material is 81 | synched in timed relation with a moving image. 82 | 83 | b. Adapter's License means the license You apply to Your Copyright 84 | and Similar Rights in Your contributions to Adapted Material in 85 | accordance with the terms and conditions of this Public License. 86 | 87 | c. BY-SA Compatible License means a license listed at 88 | creativecommons.org/compatiblelicenses, approved by Creative 89 | Commons as essentially the equivalent of this Public License. 90 | 91 | d. Copyright and Similar Rights means copyright and/or similar rights 92 | closely related to copyright including, without limitation, 93 | performance, broadcast, sound recording, and Sui Generis Database 94 | Rights, without regard to how the rights are labeled or 95 | categorized. For purposes of this Public License, the rights 96 | specified in Section 2(b)(1)-(2) are not Copyright and Similar 97 | Rights. 98 | 99 | e. Effective Technological Measures means those measures that, in the 100 | absence of proper authority, may not be circumvented under laws 101 | fulfilling obligations under Article 11 of the WIPO Copyright 102 | Treaty adopted on December 20, 1996, and/or similar international 103 | agreements. 104 | 105 | f. Exceptions and Limitations means fair use, fair dealing, and/or 106 | any other exception or limitation to Copyright and Similar Rights 107 | that applies to Your use of the Licensed Material. 108 | 109 | g. License Elements means the license attributes listed in the name 110 | of a Creative Commons Public License. The License Elements of this 111 | Public License are Attribution and ShareAlike. 112 | 113 | h. Licensed Material means the artistic or literary work, database, 114 | or other material to which the Licensor applied this Public 115 | License. 116 | 117 | i. Licensed Rights means the rights granted to You subject to the 118 | terms and conditions of this Public License, which are limited to 119 | all Copyright and Similar Rights that apply to Your use of the 120 | Licensed Material and that the Licensor has authority to license. 121 | 122 | j. Licensor means the individual(s) or entity(ies) granting rights 123 | under this Public License. 124 | 125 | k. Share means to provide material to the public by any means or 126 | process that requires permission under the Licensed Rights, such 127 | as reproduction, public display, public performance, distribution, 128 | dissemination, communication, or importation, and to make material 129 | available to the public including in ways that members of the 130 | public may access the material from a place and at a time 131 | individually chosen by them. 132 | 133 | l. Sui Generis Database Rights means rights other than copyright 134 | resulting from Directive 96/9/EC of the European Parliament and of 135 | the Council of 11 March 1996 on the legal protection of databases, 136 | as amended and/or succeeded, as well as other essentially 137 | equivalent rights anywhere in the world. 138 | 139 | m. You means the individual or entity exercising the Licensed Rights 140 | under this Public License. Your has a corresponding meaning. 141 | 142 | 143 | Section 2 -- Scope. 144 | 145 | a. License grant. 146 | 147 | 1. Subject to the terms and conditions of this Public License, 148 | the Licensor hereby grants You a worldwide, royalty-free, 149 | non-sublicensable, non-exclusive, irrevocable license to 150 | exercise the Licensed Rights in the Licensed Material to: 151 | 152 | a. reproduce and Share the Licensed Material, in whole or 153 | in part; and 154 | 155 | b. produce, reproduce, and Share Adapted Material. 156 | 157 | 2. Exceptions and Limitations. For the avoidance of doubt, where 158 | Exceptions and Limitations apply to Your use, this Public 159 | License does not apply, and You do not need to comply with 160 | its terms and conditions. 161 | 162 | 3. Term. The term of this Public License is specified in Section 163 | 6(a). 164 | 165 | 4. Media and formats; technical modifications allowed. The 166 | Licensor authorizes You to exercise the Licensed Rights in 167 | all media and formats whether now known or hereafter created, 168 | and to make technical modifications necessary to do so. The 169 | Licensor waives and/or agrees not to assert any right or 170 | authority to forbid You from making technical modifications 171 | necessary to exercise the Licensed Rights, including 172 | technical modifications necessary to circumvent Effective 173 | Technological Measures. For purposes of this Public License, 174 | simply making modifications authorized by this Section 2(a) 175 | (4) never produces Adapted Material. 176 | 177 | 5. Downstream recipients. 178 | 179 | a. Offer from the Licensor -- Licensed Material. Every 180 | recipient of the Licensed Material automatically 181 | receives an offer from the Licensor to exercise the 182 | Licensed Rights under the terms and conditions of this 183 | Public License. 184 | 185 | b. Additional offer from the Licensor -- Adapted Material. 186 | Every recipient of Adapted Material from You 187 | automatically receives an offer from the Licensor to 188 | exercise the Licensed Rights in the Adapted Material 189 | under the conditions of the Adapter's License You apply. 190 | 191 | c. No downstream restrictions. You may not offer or impose 192 | any additional or different terms or conditions on, or 193 | apply any Effective Technological Measures to, the 194 | Licensed Material if doing so restricts exercise of the 195 | Licensed Rights by any recipient of the Licensed 196 | Material. 197 | 198 | 6. No endorsement. Nothing in this Public License constitutes or 199 | may be construed as permission to assert or imply that You 200 | are, or that Your use of the Licensed Material is, connected 201 | with, or sponsored, endorsed, or granted official status by, 202 | the Licensor or others designated to receive attribution as 203 | provided in Section 3(a)(1)(A)(i). 204 | 205 | b. Other rights. 206 | 207 | 1. Moral rights, such as the right of integrity, are not 208 | licensed under this Public License, nor are publicity, 209 | privacy, and/or other similar personality rights; however, to 210 | the extent possible, the Licensor waives and/or agrees not to 211 | assert any such rights held by the Licensor to the limited 212 | extent necessary to allow You to exercise the Licensed 213 | Rights, but not otherwise. 214 | 215 | 2. Patent and trademark rights are not licensed under this 216 | Public License. 217 | 218 | 3. To the extent possible, the Licensor waives any right to 219 | collect royalties from You for the exercise of the Licensed 220 | Rights, whether directly or through a collecting society 221 | under any voluntary or waivable statutory or compulsory 222 | licensing scheme. In all other cases the Licensor expressly 223 | reserves any right to collect such royalties. 224 | 225 | 226 | Section 3 -- License Conditions. 227 | 228 | Your exercise of the Licensed Rights is expressly made subject to the 229 | following conditions. 230 | 231 | a. Attribution. 232 | 233 | 1. If You Share the Licensed Material (including in modified 234 | form), You must: 235 | 236 | a. retain the following if it is supplied by the Licensor 237 | with the Licensed Material: 238 | 239 | i. identification of the creator(s) of the Licensed 240 | Material and any others designated to receive 241 | attribution, in any reasonable manner requested by 242 | the Licensor (including by pseudonym if 243 | designated); 244 | 245 | ii. a copyright notice; 246 | 247 | iii. a notice that refers to this Public License; 248 | 249 | iv. a notice that refers to the disclaimer of 250 | warranties; 251 | 252 | v. a URI or hyperlink to the Licensed Material to the 253 | extent reasonably practicable; 254 | 255 | b. indicate if You modified the Licensed Material and 256 | retain an indication of any previous modifications; and 257 | 258 | c. indicate the Licensed Material is licensed under this 259 | Public License, and include the text of, or the URI or 260 | hyperlink to, this Public License. 261 | 262 | 2. You may satisfy the conditions in Section 3(a)(1) in any 263 | reasonable manner based on the medium, means, and context in 264 | which You Share the Licensed Material. For example, it may be 265 | reasonable to satisfy the conditions by providing a URI or 266 | hyperlink to a resource that includes the required 267 | information. 268 | 269 | 3. If requested by the Licensor, You must remove any of the 270 | information required by Section 3(a)(1)(A) to the extent 271 | reasonably practicable. 272 | 273 | b. ShareAlike. 274 | 275 | In addition to the conditions in Section 3(a), if You Share 276 | Adapted Material You produce, the following conditions also apply. 277 | 278 | 1. The Adapter's License You apply must be a Creative Commons 279 | license with the same License Elements, this version or 280 | later, or a BY-SA Compatible License. 281 | 282 | 2. You must include the text of, or the URI or hyperlink to, the 283 | Adapter's License You apply. You may satisfy this condition 284 | in any reasonable manner based on the medium, means, and 285 | context in which You Share Adapted Material. 286 | 287 | 3. You may not offer or impose any additional or different terms 288 | or conditions on, or apply any Effective Technological 289 | Measures to, Adapted Material that restrict exercise of the 290 | rights granted under the Adapter's License You apply. 291 | 292 | 293 | Section 4 -- Sui Generis Database Rights. 294 | 295 | Where the Licensed Rights include Sui Generis Database Rights that 296 | apply to Your use of the Licensed Material: 297 | 298 | a. for the avoidance of doubt, Section 2(a)(1) grants You the right 299 | to extract, reuse, reproduce, and Share all or a substantial 300 | portion of the contents of the database; 301 | 302 | b. if You include all or a substantial portion of the database 303 | contents in a database in which You have Sui Generis Database 304 | Rights, then the database in which You have Sui Generis Database 305 | Rights (but not its individual contents) is Adapted Material, 306 | 307 | including for purposes of Section 3(b); and 308 | c. You must comply with the conditions in Section 3(a) if You Share 309 | all or a substantial portion of the contents of the database. 310 | 311 | For the avoidance of doubt, this Section 4 supplements and does not 312 | replace Your obligations under this Public License where the Licensed 313 | Rights include other Copyright and Similar Rights. 314 | 315 | 316 | Section 5 -- Disclaimer of Warranties and Limitation of Liability. 317 | 318 | a. UNLESS OTHERWISE SEPARATELY UNDERTAKEN BY THE LICENSOR, TO THE 319 | EXTENT POSSIBLE, THE LICENSOR OFFERS THE LICENSED MATERIAL AS-IS 320 | AND AS-AVAILABLE, AND MAKES NO REPRESENTATIONS OR WARRANTIES OF 321 | ANY KIND CONCERNING THE LICENSED MATERIAL, WHETHER EXPRESS, 322 | IMPLIED, STATUTORY, OR OTHER. THIS INCLUDES, WITHOUT LIMITATION, 323 | WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR 324 | PURPOSE, NON-INFRINGEMENT, ABSENCE OF LATENT OR OTHER DEFECTS, 325 | ACCURACY, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT 326 | KNOWN OR DISCOVERABLE. WHERE DISCLAIMERS OF WARRANTIES ARE NOT 327 | ALLOWED IN FULL OR IN PART, THIS DISCLAIMER MAY NOT APPLY TO YOU. 328 | 329 | b. TO THE EXTENT POSSIBLE, IN NO EVENT WILL THE LICENSOR BE LIABLE 330 | TO YOU ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION, 331 | NEGLIGENCE) OR OTHERWISE FOR ANY DIRECT, SPECIAL, INDIRECT, 332 | INCIDENTAL, CONSEQUENTIAL, PUNITIVE, EXEMPLARY, OR OTHER LOSSES, 333 | COSTS, EXPENSES, OR DAMAGES ARISING OUT OF THIS PUBLIC LICENSE OR 334 | USE OF THE LICENSED MATERIAL, EVEN IF THE LICENSOR HAS BEEN 335 | ADVISED OF THE POSSIBILITY OF SUCH LOSSES, COSTS, EXPENSES, OR 336 | DAMAGES. WHERE A LIMITATION OF LIABILITY IS NOT ALLOWED IN FULL OR 337 | IN PART, THIS LIMITATION MAY NOT APPLY TO YOU. 338 | 339 | c. The disclaimer of warranties and limitation of liability provided 340 | above shall be interpreted in a manner that, to the extent 341 | possible, most closely approximates an absolute disclaimer and 342 | waiver of all liability. 343 | 344 | 345 | Section 6 -- Term and Termination. 346 | 347 | a. This Public License applies for the term of the Copyright and 348 | Similar Rights licensed here. However, if You fail to comply with 349 | this Public License, then Your rights under this Public License 350 | terminate automatically. 351 | 352 | b. Where Your right to use the Licensed Material has terminated under 353 | Section 6(a), it reinstates: 354 | 355 | 1. automatically as of the date the violation is cured, provided 356 | it is cured within 30 days of Your discovery of the 357 | violation; or 358 | 359 | 2. upon express reinstatement by the Licensor. 360 | 361 | For the avoidance of doubt, this Section 6(b) does not affect any 362 | right the Licensor may have to seek remedies for Your violations 363 | of this Public License. 364 | 365 | c. For the avoidance of doubt, the Licensor may also offer the 366 | Licensed Material under separate terms or conditions or stop 367 | distributing the Licensed Material at any time; however, doing so 368 | will not terminate this Public License. 369 | 370 | d. Sections 1, 5, 6, 7, and 8 survive termination of this Public 371 | License. 372 | 373 | 374 | Section 7 -- Other Terms and Conditions. 375 | 376 | a. The Licensor shall not be bound by any additional or different 377 | terms or conditions communicated by You unless expressly agreed. 378 | 379 | b. Any arrangements, understandings, or agreements regarding the 380 | Licensed Material not stated herein are separate from and 381 | independent of the terms and conditions of this Public License. 382 | 383 | 384 | Section 8 -- Interpretation. 385 | 386 | a. For the avoidance of doubt, this Public License does not, and 387 | shall not be interpreted to, reduce, limit, restrict, or impose 388 | conditions on any use of the Licensed Material that could lawfully 389 | be made without permission under this Public License. 390 | 391 | b. To the extent possible, if any provision of this Public License is 392 | deemed unenforceable, it shall be automatically reformed to the 393 | minimum extent necessary to make it enforceable. If the provision 394 | cannot be reformed, it shall be severed from this Public License 395 | without affecting the enforceability of the remaining terms and 396 | conditions. 397 | 398 | c. No term or condition of this Public License will be waived and no 399 | failure to comply consented to unless expressly agreed to by the 400 | Licensor. 401 | 402 | d. Nothing in this Public License constitutes or may be interpreted 403 | as a limitation upon, or waiver of, any privileges and immunities 404 | that apply to the Licensor or You, including from the legal 405 | processes of any jurisdiction or authority. 406 | 407 | 408 | ======================================================================= 409 | 410 | Creative Commons is not a party to its public 411 | licenses. Notwithstanding, Creative Commons may elect to apply one of 412 | its public licenses to material it publishes and in those instances 413 | will be considered the “Licensor.” The text of the Creative Commons 414 | public licenses is dedicated to the public domain under the CC0 Public 415 | Domain Dedication. Except for the limited purpose of indicating that 416 | material is shared under a Creative Commons public license or as 417 | otherwise permitted by the Creative Commons policies published at 418 | creativecommons.org/policies, Creative Commons does not authorize the 419 | use of the trademark "Creative Commons" or any other trademark or logo 420 | of Creative Commons without its prior written consent including, 421 | without limitation, in connection with any unauthorized modifications 422 | to any of its public licenses or any other arrangements, 423 | understandings, or agreements concerning use of licensed material. For 424 | the avoidance of doubt, this paragraph does not form part of the 425 | public licenses. 426 | 427 | Creative Commons may be contacted at creativecommons.org. -------------------------------------------------------------------------------- /README-cn.md: -------------------------------------------------------------------------------- 1 | # [译] Google Interview University 一套完整的学习手册帮助自己准备 Google 的面试 2 | 3 | > * 原文地址：[Google Interview University](https://github.com/jwasham/google-interview-university) 4 | * 原文作者：[John Washam](https://github.com/jwasham) 5 | * 译文出自：[掘金翻译计划](https://github.com/xitu/gold-miner) 6 | * 译者：[Aleen](https://github.com/aleen42)，[Newton](https://github.com/Newt0n)，[bobmayuze](https://github.com/bobmayuze)，[Jaeger](https://github.com/laobie)，[sqrthree](https://github.com/sqrthree) 7 | 8 | ## 这是？ 9 | 10 | 这是我为了从 web 开发者（自学、非计算机科学学位）蜕变至 Google 软件工程师所制定的计划，其内容历时数月。 11 | 12 | ![白板上编程 ———— 来自 HBO 频道的剧集，“硅谷”](https://dng5l3qzreal6.cloudfront.net/2016/Aug/coding_board_small-1470866369118.jpg) 13 | 14 | 这一长列表是从 **Google 的指导笔记** 中萃取出来并进行扩展。因此，有些事情你必须去了解一下。我在列表的底部添加了一些额外项，用于解决面试中可能会出现的问题。这些额外项大部分是来自于 Steve Yegge 的“[得到在 Google 工作的机会](http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html)”。而在 Google 指导笔记的逐字间，它们有时也会被反映出来。 15 | 16 | --- 17 | 18 | ## 目录 19 | 20 | - [这是？](#这是) 21 | - [为何要用到它？](#为何要用到它) 22 | - [如何使用它](#如何使用它) 23 | - [拥有一名 Googler 的心态](#拥有一名-googler-的心态) 24 | - [我得到了工作吗？](#我得到了工作吗) 25 | - [跟随着我](#跟随着我) 26 | - [不要自以为自己足够聪明](#不要自以为自己足够聪明) 27 | - [关于 Google](#关于-google) 28 | - [相关视频资源](#相关视频资源) 29 | - [面试过程 & 通用的面试准备](#面试过程--通用的面试准备) 30 | - [为你的面试选择一种语言](#为你的面试选择一种语言) 31 | - [在你开始之前](#在你开始之前) 32 | - [你所看不到的](#你所看不到的) 33 | - [日常计划](#日常计划) 34 | - [必备知识](#必备知识) 35 | - [算法复杂度 / Big-O / 渐进分析法](#算法复杂度--big-o--渐进分析法) 36 | - [数据结构](#数据结构) 37 | - [数组（Arrays）](#数组arrays) 38 | - [链表（Linked Lists）](#链表linked-lists) 39 | - [堆栈（Stack）](#堆栈stack) 40 | - [队列（Queue）](#队列queue) 41 | - [哈希表（Hash table）](#哈希表hash-table) 42 | - [更多的知识](#更多的知识) 43 | - [二分查找（Binary search）](#二分查找binary-search) 44 | - [按位运算（Bitwise operations）](#按位运算bitwise-operations) 45 | - [树（Trees）](#树trees) 46 | - [树 —— 笔记 & 背景](#树--笔记--背景) 47 | - [二叉查找树（Binary search trees）：BSTs](#二叉查找树binary-search-treesbsts) 48 | - [堆（Heap） / 优先级队列（Priority Queue） / 二叉堆（Binary Heap）](#堆heap--优先级队列priority-queue--二叉堆binary-heap) 49 | - [字典树（Tries）](#字典树tries) 50 | - [平衡查找树（Balanced search trees）](#平衡查找树balanced-search-trees) 51 | - [N 叉树（K 叉树、M 叉树）](#n-叉树k-叉树m-叉树) 52 | - [排序](#排序sorting) 53 | - [图（Graphs）](#图graphs) 54 | - [更多知识](#更多知识) 55 | - [递归](#递归recursion) 56 | - [动态规划](#动态规划dynamic-programming) 57 | - [组合 & 概率](#组合combinatorics-n-中选-k-个--概率probability) 58 | - [NP, NP-完全和近似算法](#np-np-完全和近似算法) 59 | - [缓存](#缓存cache) 60 | - [进程和线程](#进程processe和线程thread) 61 | - [系统设计、可伸缩性、数据处理](#系统设计可伸缩性数据处理) 62 | - [论文](#论文) 63 | - [测试](#测试) 64 | - [调度](#调度) 65 | - [实现系统例程](#实现系统例程) 66 | - [字符串搜索和操作](#字符串搜索和操作) 67 | - [终面](#终面) 68 | - [书籍](#书籍) 69 | - [编码练习和挑战](#编码练习和挑战) 70 | - [当你临近面试时](#当你临近面试时) 71 | - [你的简历](#你的简历) 72 | - [当面试来临的时候](#当面试来临的时候) 73 | - [问面试官的问题](#问面试官的问题) 74 | - [当你获得了梦想的职位](#当你获得了梦想的职位) 75 | 76 | ---------------- 下面的内容是可选的 ---------------- 77 | 78 | - [附加的学习](#附加的学习) 79 | - [Unicode](#unicode) 80 | - [字节顺序](#字节顺序) 81 | - [Emacs and vi(m)](#emacs-and-vim) 82 | - [Unix 命令行工具](#unix-命令行工具) 83 | - [信息资源 (视频)](#信息资源-视频) 84 | - [奇偶校验位 & 汉明码 (视频)](#奇偶校验位--汉明码-视频) 85 | - [系统熵值（系统复杂度）](#系统熵值系统复杂度) 86 | - [密码学](#密码学) 87 | - [压缩](#压缩) 88 | - [网络 (视频)](#网络-视频) 89 | - [计算机安全](#计算机安全) 90 | - [释放缓存](#释放缓存) 91 | - [并行/并发编程](#并行并发编程) 92 | - [设计模式](#设计模式) 93 | - [信息传输, 序列化, 和队列化的系统](#信息传输-序列化和队列化的系统) 94 | - [快速傅里叶变换](#快速傅里叶变换) 95 | - [布隆过滤器](#布隆过滤器) 96 | - [van Emde Boas 树](#van-emde-boas-树) 97 | - [更深入的数据结构](#更深入的数据结构) 98 | - [跳表](#跳表) 99 | - [网络流](#网络流) 100 | - [不相交集 & 联合查找](#不相交集--联合查找) 101 | - [快速处理数学](#math-for-fast-processing) 102 | - [树堆 (Treap)](#树堆-treap) 103 | - [线性规划](#线性规划linear-programming视频) 104 | - [几何：凸包（Geometry, Convex hull）](#几何凸包geometry-convex-hull视频) 105 | - [离散数学](#离散数学) 106 | - [机器学习](#机器学习machine-learning) 107 | - [Go 语言](#go-语言) 108 | - [一些主题的额外内容](#一些主题的额外内容) 109 | - [视频系列](#视频系列) 110 | - [计算机科学课程](#计算机科学课程) 111 | 112 | --- 113 | 114 | ## 为何要用到它？ 115 | 116 | 我一直都是遵循该计划去准备 Google 的面试。自 1997 年以来，我一直从事于 web 程序的构建、服务器的构建及创业型公司的创办。对于只有着一个经济学学位，而不是计算机科学学位（CS degree）的我来说，在职业生涯中所取得的都非常成功。然而，我想在 Google 工作，并进入大型系统中，真正地去理解计算机系统、算法效率、数据结构性能、低级别编程语言及其工作原理。可一项都不了解的我，怎么会被 Google 所应聘呢？ 117 | 118 | 当我创建该项目时，我从一个堆栈到一个堆都不了解。那时的我，完全不了解 Big-O 、树，或如何去遍历一个图。如果非要我去编写一个排序算法的话，我只能说我所写的肯定是很糟糕。一直以来，我所用的任何数据结构都是内建于编程语言当中。至于它们在背后是如何运作，对此我一概不清楚。此外，以前的我并不需要对内存进行管理，最多就只是在一个正在执行的进程抛出了“内存不足”的错误后，采取一些权变措施。而在我的编程生活中，也甚少使用到多维数组，可关联数组却成千上万。而且，从一开始到现在，我都还未曾自己实现过数据结构。 119 | 120 | 就是这样的我，在经过该学习计划后，已然对被 Google 所雇佣充满信心。这是一个漫长的计划，以至于花费了我数月的时间。若您早已熟悉大部分的知识，那么也许能节省大量的时间。 121 | 122 | ## 如何使用它 123 | 124 | 下面所有的东西都只是一个概述。因此，你需要由上而下逐一地去处理它。 125 | 126 | 在学习过程中，我是使用 GitHub 特殊的语法特性 markdown flavor 去检查计划的进展，包括使用任务列表。 127 | 128 | - [x] 创建一个新的分支，以使得你可以像这样去检查计划的进展。直接往方括号中填写一个字符 x 即可：[x] 129 | 130 | [更多关于 Github-flavored markdown 的详情](https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown) 131 | 132 | ## 拥有一名 Googler 的心态 133 | 134 | 把一个（或两个）印有“[future Googler](https://github.com/jwasham/google-interview-university/blob/master/extras/future-googler.pdf)”的图案打印出来，并用你誓要成功的眼神盯着它。 135 | 136 | [![future Googler sign](https://dng5l3qzreal6.cloudfront.net/2016/Oct/Screen_Shot_2016_10_04_at_10_13_24_AM-1475601104364.png)](https://github.com/jwasham/google-interview-university/blob/master/extras/future-googler.pdf) 137 | 138 | ## 我得到了工作吗？ 139 | 140 | 我还没去应聘。 141 | 142 | 因为我离完成学习（完成该疯狂的计划列表）还需要数天的时间，并打算在下周开始用一整天的时间，以编程的方式去解决问题。当然，这将会持续数周的时间。然后，我才通过使用在二月份所得到的一个介绍资格，去正式应聘 Google（没错，是二月份时就得到的）。 143 | 144 | 感谢 JP 的这次介绍。 145 | 146 | ## 跟随着我 147 | 148 | 目前我仍在该计划的执行过程中，如果你想跟随我脚步去学习的话，可以登进我在 [GoogleyAsHeck.com](https://googleyasheck.com/) 上所写的博客。 149 | 150 | 下面是我的联系方式： 151 | 152 | - Twitter: [@googleyasheck](https://twitter.com/googleyasheck) 153 | - Twitter: [@StartupNextDoor](https://twitter.com/StartupNextDoor) 154 | - Google+: [+Googleyasheck](https://plus.google.com/+Googleyasheck) 155 | - LinkedIn: [johnawasham](https://www.linkedin.com/in/johnawasham) 156 | 157 | ![John Washam - Google Interview University](https://dng5l3qzreal6.cloudfront.net/2016/Aug/book_stack_photo_resized_18_1469302751157-1472661280368.png) 158 | 159 | ## 不要自以为自己足够聪明 160 | 161 | - Google 的工程师都是才智过人的。但是，就算是工作在 Google 的他们，仍然会因为自己不够聪明而感到一种不安。 162 | - [天才程序员的神话](https://www.youtube.com/watch?v=0SARbwvhupQ) 163 | 164 | ## 关于 Google 165 | 166 | - [ ] 面向学生 —— [Google 的职业生涯：技术开发指导](https://www.google.com/about/careers/students/guide-to-technical-development.html) 167 | - [ ] Google 检索的原理： 168 | - [ ] [Google 检索的发展史（视频）](https://www.youtube.com/watch?v=mTBShTwCnD4) 169 | - [ ] [Google 检索的原理 —— 故事篇](https://www.google.com/insidesearch/howsearchworks/thestory/) 170 | - [ ] [Google 检索的原理](https://www.google.com/insidesearch/howsearchworks/) 171 | - [ ] [Google 检索的原理 —— Matt Cutts（视频）](https://www.youtube.com/watch?v=BNHR6IQJGZs) 172 | - [ ] [Google 是如何改善其检索算法（视频）](https://www.youtube.com/watch?v=J5RZOU6vK4Q) 173 | - [ ] 系列文章： 174 | - [ ] [Google 检索是如何处理移动设备](https://backchannel.com/how-google-search-dealt-with-mobile-33bc09852dc9) 175 | - [ ] [Google 为了寻找大众需求的秘密研究](https://backchannel.com/googles-secret-study-to-find-out-our-needs-eba8700263bf) 176 | - [ ] [Google 检索将成为你的下一个大脑](https://backchannel.com/google-search-will-be-your-next-brain-5207c26e4523) 177 | - [ ] [Demis Hassabis 的心灵直白](https://backchannel.com/the-deep-mind-of-demis-hassabis-156112890d8a) 178 | - [ ] [书籍：Google 公司是如何运作的](https://www.amazon.com/How-Google-Works-Eric-Schmidt/dp/1455582344) 179 | - [ ] [由 Google 通告所制作 —— 2016年10月（视频）](https://www.youtube.com/watch?v=q4y0KOeXViI) 180 | 181 | ## 相关视频资源 182 | 183 | 部分视频只能通过在 Coursera、Edx 或 Lynda.com class 上注册登录才能观看。这些视频被称为网络公开课程（MOOC）。即便是免费观看，部分课程可能会由于不在时间段内而无法获取。因此，你需要多等待几个月。 184 | 185 | 很感谢您能帮我把网络公开课程的视频链接转换成公开的视频源，以代替那些在线课程的视频。此外，一些大学的讲座视频也是我所青睐的。 186 | 187 | ## 面试过程 & 通用的面试准备 188 | 189 | - [ ] 视频： 190 | - [ ] [如何在 Google 工作 —— 考生指导课程（视频）](https://www.youtube.com/watch?v=oWbUtlUhwa8&feature=youtu.be) 191 | - [ ] [Google 招聘者所分享的技术面试小窍门（视频）](https://www.youtube.com/watch?v=qc1owf2-220&feature=youtu.be) 192 | - [ ] [如何在 Google 工作：技术型简历的准备（视频）](https://www.youtube.com/watch?v=8npJLXkcmu8) 193 | 194 | - [ ] 文章： 195 | - [ ] [三步成为 Googler](http://www.google.com/about/careers/lifeatgoogle/hiringprocess/) 196 | - [ ] [得到在 Google 的工作机会](http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html) 197 | - 所有他所提及的事情都列在了下面 198 | - [ ] _（早已过期）_ [如何得到 Google 的一份工作，面试题，应聘过程](http://dondodge.typepad.com/the_next_big_thing/2010/09/how-to-get-a-job-at-google-interview-questions-hiring-process.html) 199 | - [ ] [手机设备屏幕的问题](http://sites.google.com/site/steveyegge2/five-essential-phone-screen-questions) 200 | 201 | - [ ] 附加的（虽然 Google 不建议，但我还是添加在此）： 202 | - [ ] [ABC：永远都要去编程（Always Be Coding）](https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.4heg8zvm4) 203 | - [ ] [四步成为 Google 里一名没有学位的员工](https://medium.com/always-be-coding/four-steps-to-google-without-a-degree-8f381aa6bd5e#.asalo1vfx) 204 | - [ ] [共享白板（Whiteboarding）](https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1) 205 | - [ ] [Google 是如何看待应聘、管理和公司文化](http://www.kpcb.com/blog/lessons-learned-how-google-thinks-about-hiring-management-and-culture) 206 | - [ ] [程序开发面试中有效的白板（Whiteboarding）](http://www.coderust.com/blog/2014/04/10/effective-whiteboarding-during-programming-interviews/) 207 | - [ ] 震撼开发类面试 第一集： 208 | - [ ] [Gayle L McDowell —— 震撼开发类面试（视频）](https://www.youtube.com/watch?v=rEJzOhC5ZtQ) 209 | - [ ] [震撼开发类面试 —— 作者 Gayle Laakmann McDowell（视频）](https://www.youtube.com/watch?v=aClxtDcdpsQ) 210 | - [ ] 如何在世界四强企业中获得一份工作： 211 | - [ ] [“如何在世界四强企业中获得一份工作 —— Amazon、Facebook、Google 和 Microsoft”（视频）](https://www.youtube.com/watch?v=YJZCUhxNCv8) 212 | - [ ] [面试 Google 失败](http://alexbowe.com/failing-at-google-interviews/) 213 | 214 | ## 为你的面试选择一种语言 215 | 216 | 在这，我就以下话题写一篇短文 —— [重点：为在 Google 的面试选择一种语言](https://googleyasheck.com/important-pick-one-language-for-the-google-interview/) 217 | 218 | 在大多数公司的面试当中，你可以在编程这一环节，使用一种自己用起来较为舒适的语言去完成编程。但在 Google，你只有三种固定的选择： 219 | 220 | - C++ 221 | - Java 222 | - Python 223 | 224 | 有时你也可以使用下面两种，但需要事先查阅说明。因为，说明中会有警告： 225 | 226 | - JavaScript 227 | - Ruby 228 | 229 | 你需要对你所选择的语言感到非常舒适且足够了解。 230 | 231 | 更多关于语言选择的阅读： 232 | 233 | - http://www.byte-by-byte.com/choose-the-right-language-for-your-coding-interview/ 234 | - http://blog.codingforinterviews.com/best-programming-language-jobs/ 235 | - https://www.quora.com/What-is-the-best-language-to-program-in-for-an-in-person-Google-interview 236 | 237 | [在此查看相关语言的资源](programming-language-resources.md) 238 | 239 | 由于，我正在学习C、C++ 和 Python。因此，在下面你会看到部分关于它们的学习资料。相关书籍请看文章的底部。 240 | 241 | ## 在你开始之前 242 | 243 | 该列表已经持续更新了很长的一段时间，所以，我们的确很容易会对其失去控制。 244 | 245 | 这里列出了一些我所犯过的错误，希望您不要重滔覆辙。 246 | 247 | ### 1. 你不可能把所有的东西都记住 248 | 249 | 就算我查看了数小时的视频，并记录了大量的笔记。几个月后的我，仍然会忘却其中大部分的东西。所以，我翻阅了我的笔记，并将可回顾的东西制作成抽认卡（flashcard）（请往下看） 250 | 251 | ### 2. 使用抽认卡 252 | 253 | 为了解决善忘的问题，我制作了一些关于抽认卡的页面，用于添加两种抽认卡：正常的及带有代码的。每种卡都会有不同的格式设计。 254 | 255 | 而且，我还以移动设备为先去设计这些网页，以使得在任何地方的我，都能通过我的手机及平板去回顾知识。 256 | 257 | 你也可以免费制作属于你自己的抽认卡网站： 258 | 259 | - [抽认卡页面的代码仓库](https://github.com/jwasham/computer-science-flash-cards) 260 | - [我的抽认卡数据库](https://github.com/jwasham/computer-science-flash-cards/blob/master/cards-jwasham.db)：有一点需要记住的是，我做事有点过头，以至于把卡片都覆盖到所有的东西上。从汇编语言和 Python 的细枝末节，乃至到机器学习和统计都被覆盖到卡片上。而这种做法，对于 Google 的要求来说，却是多余。 261 | 262 | **在抽认卡上做笔记：** 若你第一次发现你知道问题的答案时，先不要急着把其标注成“已懂”。你需要做的，是去查看一下是否有同样的抽认卡，并在你真正懂得如何解决问题之前，多问自己几次。重复地问答可帮助您深刻记住该知识点。 263 | 264 | ### 3. 回顾，回顾，回顾 265 | 266 | 我留有一组 ASCII 码表、OSI 堆栈、Big-O 记号及更多的小抄纸，以便在空余的时候可以学习。 267 | 268 | 每编程半个小时就要休息一下，并去回顾你的抽认卡。 269 | 270 | ### 4. 专注 271 | 272 | 在学习的过程中，往往会有许多令人分心的事占据着我们宝贵的时间。因此，专注和集中注意力是非常困难的。 273 | 274 | ## 你所看不到的 275 | 276 | 由于，这个巨大的列表一开始是作为我个人从 Google 面试指导笔记所形成的一个事件处理列表。因此，有一些我熟悉且普遍的技术在此都未被谈及到： 277 | 278 | - SQL 279 | - Javascript 280 | - HTML、CSS 和其他前端技术 281 | 282 | ## 日常计划 283 | 284 | 部分问题可能会花费一天的时间去学习，而部分则会花费多天。当然，有些学习并不需要我们懂得如何实现。 285 | 286 | 因此，每一天我都会在下面所列出的列表中选择一项，并查看相关的视频。然后，使用以下的一种语言去实现： 287 | 288 | C —— 使用结构体和函数，该函数会接受一个结构体指针 * 及其他数据作为参数。 289 | C++ —— 不使用内建的数据类型。 290 | C++ —— 使用内建的数据类型，如使用 STL 的 std::list 来作为链表。 291 | Python —— 使用内建的数据类型（为了持续练习 Python），并编写一些测试去保证自己代码的正确性。有时，只需要使用断言函数 assert() 即可。 292 | 此外，你也可以使用 Java 或其他语言。以上只是我的个人偏好而已。 293 | 294 | 为何要在这些语言上分别实现一次？ 295 | 296 | 因为可以练习，练习，练习，直至我厌倦它，并完美地实现出来。（若有部分边缘条件没想到时，我会用书写的形式记录下来并去记忆） 297 | 因为可以在纯原生的条件下工作（不需垃圾回收机制的帮助下，分配/释放内存（除了 Python）） 298 | 因为可以利用上内建的数据类型，以使得我拥有在现实中使用内建工具的经验（在生产环境中，我不会去实现自己的链表） 299 | 300 | 就算我没有时间去每一项都这么做，但我也会尽我所能的。 301 | 302 | 在这里，你可以查看到我的代码： 303 | - [C](https://github.com/jwasham/practice-c) 304 | - [C++](https://github.com/jwasham/practice-cpp) 305 | - [Python](https://github.com/jwasham/practice-python) 306 | 307 | 你不需要记住每一个算法的内部原理。 308 | 309 | 在一个白板上写代码，而不要直接在计算机上编写。在测试完部分简单的输入后，到计算机上再测试一遍。 310 | 311 | ## 必备知识 312 | 313 | - [ ] **计算机是如何处理一段程序：** 314 | - [ ] [CPU 是如何执行代码（视频）](https://www.youtube.com/watch?v=42KTvGYQYnA) 315 | - [ ] [机器码指令（视频）](https://www.youtube.com/watch?v=Mv2XQgpbTNE) 316 | 317 | - [ ] **编译器** 318 | - [ ] [编译器是如何在 ~1 分钟内工作（视频）](https://www.youtube.com/watch?v=IhC7sdYe-Jg) 319 | - [ ] [Hardvard CS50 —— 编译器（视频）](https://www.youtube.com/watch?v=CSZLNYF4Klo) 320 | - [ ] [C++（视频）](https://www.youtube.com/watch?v=twodd1KFfGk) 321 | - [ ] [掌握编译器的优化（C++）（视频）](https://www.youtube.com/watch?v=FnGCDLhaxKU) 322 | 323 | - [ ] **浮点数是如何存储的：** 324 | - [ ] 简单的 8-bit：[浮点数的表达形式　—— 1（视频 —— 在计算上有一个错误 —— 详情请查看视频的介绍）](https://www.youtube.com/watch?v=ji3SfClm8TU) 325 | - [ ] 32 bit：[IEEE754 32-bit 浮点二进制（视频）](https://www.youtube.com/watch?v=50ZYcZebIec) 326 | 327 | ## 算法复杂度 / Big-O / 渐进分析法 328 | - 并不需要实现 329 | - [ ] [Harvard CS50 —— 渐进表示（视频）](https://www.youtube.com/watch?v=iOq5kSKqeR4) 330 | - [ ] [Big O 记号（通用快速教程）（视频）](https://www.youtube.com/watch?v=V6mKVRU1evU) 331 | - [ ] [Big O 记号（以及 Omega 和 Theta）—— 最佳数学解释（视频）](https://www.youtube.com/watch?v=ei-A_wy5Yxw&index=2&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN) 332 | - [ ] Skiena 算法： 333 | - [视频](https://www.youtube.com/watch?v=gSyDMtdPNpU&index=2&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) 334 | - [幻灯片](http://www3.cs.stonybrook.edu/~algorith/video-lectures/2007/lecture2.pdf) 335 | - [ ] [对于算法复杂度分析的一次详细介绍](http://discrete.gr/complexity/) 336 | - [ ] [增长阶数（Orders of Growth）（视频）](https://class.coursera.org/algorithmicthink1-004/lecture/59) 337 | - [ ] [渐进性（Asymptotics）（视频）](https://class.coursera.org/algorithmicthink1-004/lecture/61) 338 | - [ ] [UC Berkeley Big O（视频）](https://youtu.be/VIS4YDpuP98) 339 | - [ ] [UC Berkeley Big Omega（视频）](https://youtu.be/ca3e7UVmeUc) 340 | - [ ] [平摊分析法（Amortized Analysis）（视频）](https://www.youtube.com/watch?v=B3SpQZaAZP4&index=10&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN) 341 | - [ ] [举证“Big O”（视频）](https://class.coursera.org/algorithmicthink1-004/lecture/63) 342 | - [ ] 高级编程（包括递归关系和主定理）： 343 | - [计算性复杂度：第一部](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/) 344 | - [计算性复杂度：第二部](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/) 345 | - [ ] [速查表（Cheat sheet）](http://bigocheatsheet.com/) 346 | 347 | 如果部分课程过于学术性，你可直接跳到文章底部，去查看离散数学的视频以获取相关背景知识。 348 | 349 | ## 数据结构 350 | 351 | - ### 数组（Arrays） 352 | - 实现一个可自动调整大小的动态数组。 353 | - [ ] 介绍： 354 | - [数组（视频）](https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays) 355 | - [数组的基础知识（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Basic-arrays/149042/177104-4.html) 356 | - [多维数组（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Multidimensional-arrays/149042/177105-4.html) 357 | - [动态数组（视频）](https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays) 358 | - [不规则数组（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Jagged-arrays/149042/177106-4.html) 359 | - [调整数组的大小（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Resizable-arrays/149042/177108-4.html) 360 | - [ ] 实现一个动态数组（可自动调整大小的可变数组）： 361 | - [ ] 练习使用数组和指针去编码，并且指针是通过计算去跳转而不是使用索引 362 | - [ ] 通过分配内存来新建一个原生数据型数组 363 | - 可以使用 int 类型的数组，但不能使用其语法特性 364 | - 从大小为16或更大的数（使用2的倍数 —— 16、32、64、128）开始编写 365 | - [ ] size() —— 数组元素的个数 366 | - [ ] capacity() —— 可容纳元素的个数 367 | - [ ] is_empty() 368 | - [ ] at(index) —— 返回对应索引的元素，且若索引越界则愤然报错 369 | - [ ] push(item) 370 | - [ ] insert(index, item) —— 在指定索引中插入元素，并把后面的元素依次后移 371 | - [ ] prepend(item) —— 可以使用上面的 insert 函数，传参 index 为 0 372 | - [ ] pop() —— 删除在数组末端的元素，并返回其值 373 | - [ ] delete(index) —— 删除指定索引的元素，并把后面的元素依次前移 374 | - [ ] remove(item) —— 删除指定值的元素，并返回其索引（即使有多个元素） 375 | - [ ] find(item) —— 寻找指定值的元素并返回其中第一个出现的元素其索引，若未找到则返回 -1 376 | - [ ] resize(new_capacity) // 私有函数 377 | - 若数组的大小到达其容积，则变大一倍 378 | - 获取元素后，若数组大小为其容积的1/4，则缩小一半 379 | - [ ] 时间复杂度 380 | - 在数组末端增加/删除、定位、更新元素，只允许占 O(1) 的时间复杂度（平摊（amortized）去分配内存以获取更多空间） 381 | - 在数组任何地方插入/移除元素，只允许 O(n) 的时间复杂度 382 | - [ ] 空间复杂度 383 | - 因为在内存中分配的空间邻近，所以有助于提高性能 384 | - 空间需求 = （大于或等于 n 的数组容积）* 元素的大小。即便空间需求为 2n，其空间复杂度仍然是 O(n) 385 | 386 | - ### 链表（Linked Lists） 387 | - [ ] 介绍： 388 | - [ ] [单向链表（视频）](https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists) 389 | - [ ] [CS 61B —— 链表（视频）](https://www.youtube.com/watch?v=sJtJOtXCW_M&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=5) 390 | - [ ] [C 代码（视频）](https://www.youtube.com/watch?v=QN6FPiD0Gzo) 391 | - 并非看完整个视频，只需要看关于节点结果和内存分配那一部分即可 392 | - [ ] 链表 vs 数组： 393 | - [基本链表 Vs 数组（视频）](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/rjBs9/core-linked-lists-vs-arrays) 394 | - [在现实中，链表 Vs 数组（视频）](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/QUaUd/in-the-real-world-lists-vs-arrays) 395 | - [ ] [为什么你需要避免使用链表（视频）](https://www.youtube.com/watch?v=YQs6IC-vgmo) 396 | - [ ] 的确：你需要关于“指向指针的指针”的相关知识：（因为当你传递一个指针到一个函数时，该函数可能会改变指针所指向的地址）该页只是为了让你了解“指向指针的指针”这一概念。但我并不推荐这种链式遍历的风格。因为，这种风格的代码，其可读性和可维护性太低。 397 | - [指向指针的指针](https://www.eskimo.com/~scs/cclass/int/sx8.html) 398 | - [ ] 实现（我实现了使用尾指针以及没有使用尾指针这两种情况）： 399 | - [ ] size() —— 返回链表中数据元素的个数 400 | - [ ] empty() —— 若链表为空则返回一个布尔值 true 401 | - [ ] value_at(index) —— 返回第 n 个元素的值（从0开始计算） 402 | - [ ] push_front(value) —— 添加元素到链表的首部 403 | - [ ] pop_front() —— 删除首部元素并返回其值 404 | - [ ] push_back(value) —— 添加元素到链表的尾部 405 | - [ ] pop_back() —— 删除尾部元素并返回其值 406 | - [ ] front() —— 返回首部元素的值 407 | - [ ] back() —— 返回尾部元素的值 408 | - [ ] insert(index, value) —— 插入值到指定的索引，并把当前索引的元素指向到新的元素 409 | - [ ] erase(index) —— 删除指定索引的节点 410 | - [ ] value_n_from_end(n) —— 返回倒数第 n 个节点的值 411 | - [ ] reverse() —— 逆序链表 412 | - [ ] remove_value(value) —— 删除链表中指定值的第一个元素 413 | - [ ] 双向链表 414 | - [介绍（视频）](https://www.coursera.org/learn/data-structures/lecture/jpGKD/doubly-linked-lists) 415 | - 并不需要实现 416 | 417 | - ### 堆栈（Stack） 418 | - [ ] [堆栈（视频）](https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks) 419 | - [ ] [使用堆栈 —— 后进先出（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-stacks-last-first-out/149042/177120-4.html) 420 | - [ ] 可以不实现，因为使用数组来实现并不重要 421 | 422 | - ### 队列（Queue） 423 | - [ ] [使用队列 —— 先进先出（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-queues-first-first-out/149042/177122-4.html) 424 | - [ ] [队列（视频）](https://www.coursera.org/learn/data-structures/lecture/EShpq/queue) 425 | - [ ] [原型队列/先进先出（FIFO）](https://en.wikipedia.org/wiki/Circular_buffer) 426 | - [ ] [优先级队列（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Priority-queues-deques/149042/177123-4.html) 427 | - [ ] 使用含有尾部指针的链表来实现: 428 | - enqueue(value) —— 在尾部添加值 429 | - dequeue() —— 删除最早添加的元素并返回其值（首部元素） 430 | - empty() 431 | - [ ] 使用固定大小的数组实现： 432 | - enqueue(value) —— 在可容的情况下添加元素到尾部 433 | - dequeue() —— 删除最早添加的元素并返回其值 434 | - empty() 435 | - full() 436 | - [ ] 花销： 437 | - 在糟糕的实现情况下，使用链表所实现的队列，其入列和出列的时间复杂度将会是 O(n)。因为，你需要找到下一个元素，以致循环整个队列 438 | - enqueue：O(1)（平摊（amortized）、链表和数组 [探测（probing）]） 439 | - dequeue：O(1)（链表和数组） 440 | - empty：O(1)（链表和数组） 441 | 442 | - ### 哈希表（Hash table） 443 | - [ ] 视频： 444 | - [ ] [链式哈希表（视频）](https://www.youtube.com/watch?v=0M_kIqhwbFo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=8) 445 | - [ ] [Table Doubling 和 Karp-Rabin（视频）](https://www.youtube.com/watch?v=BRO7mVIFt08&index=9&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) 446 | - [ ] [Open Addressing 和密码型哈希（Cryptographic Hashing）（视频）](https://www.youtube.com/watch?v=rvdJDijO2Ro&index=10&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) 447 | - [ ] [PyCon 2010：The Mighty Dictionary（视频）](https://www.youtube.com/watch?v=C4Kc8xzcA68) 448 | - [ ] [（进阶）随机取样（Randomization）：全域哈希（Universal Hashing）& 完美哈希（Perfect Hashing）（视频）](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11) 449 | - [ ] [（进阶）完美哈希（Perfect hashing）（视频）](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4) 450 | 451 | - [ ] 在线课程： 452 | - [ ] [哈希函数的掌握（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Understanding-hash-functions/149042/177126-4.html) 453 | - [ ] [使用哈希表（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-hash-tables/149042/177127-4.html) 454 | - [ ] [哈希表的支持（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Supporting-hashing/149042/177128-4.html) 455 | - [ ] [哈希表的语言支持（视频）](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Language-support-hash-tables/149042/177129-4.html) 456 | - [ ] [基本哈希表（视频）](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables) 457 | - [ ] [数据结构（视频）](https://www.coursera.org/learn/data-structures/home/week/3) 458 | - [ ] [电话薄问题（Phone Book Problem）（视频）](https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem) 459 | - [ ] 分布式哈希表： 460 | - [Dropbox 中的瞬时上传及存储优化（视频）](https://www.coursera.org/learn/data-structures/lecture/DvaIb/instant-uploads-and-storage-optimization-in-dropbox) 461 | - [分布式哈希表（视频）](https://www.coursera.org/learn/data-structures/lecture/tvH8H/distributed-hash-tables) 462 | 463 | - [ ] 使用线性探测的数组去实现 464 | - hash(k, m) —— m 是哈希表的大小 465 | - add(key, value) —— 如果 key 已存在则更新值 466 | - exists(key) 467 | - get(key) 468 | - remove(key) 469 | 470 | ## 更多的知识 471 | 472 | - ### 二分查找（Binary search） 473 | - [ ] [二分查找（视频）](https://www.youtube.com/watch?v=D5SrAga1pno) 474 | - [ ] [二分查找（视频）](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search) 475 | - [ ] [详情](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/) 476 | - [ ] 实现： 477 | - 二分查找（在一个已排序好的整型数组中查找） 478 | - 迭代式二分查找 479 | 480 | - ### 按位运算（Bitwise operations） 481 | - [ ] [Bits 速查表](https://github.com/jwasham/google-interview-university/blob/master/extras/cheat%20sheets/bits-cheat-cheet.pdf) 482 | - 你需要知道大量2的幂数值（从2^1 到 2^16 及 2^32） 483 | - [ ] 好好理解位操作符的含义：&、|、^、~、>>、<< 484 | - [ ] [字码（words）](https://en.wikipedia.org/wiki/Word_(computer_architecture)) 485 | - [ ] 好的介绍： 486 | [位操作（视频）](https://www.youtube.com/watch?v=7jkIUgLC29I) 487 | - [ ] [C 语言编程教程 2-10：按位运算（视频）](https://www.youtube.com/watch?v=d0AwjSpNXR0) 488 | - [ ] [位操作](https://en.wikipedia.org/wiki/Bit_manipulation) 489 | - [ ] [按位运算](https://en.wikipedia.org/wiki/Bitwise_operation) 490 | - [ ] [Bithacks](https://graphics.stanford.edu/~seander/bithacks.html) 491 | - [ ] [位元抚弄者（The Bit Twiddler）](http://bits.stephan-brumme.com/) 492 | - [ ] [交互式位元抚弄者（The Bit Twiddler Interactive）](http://bits.stephan-brumme.com/interactive.html) 493 | - [ ] 一补数和补码 494 | - [二进制：利 & 弊（为什么我们要使用补码）（视频）](https://www.youtube.com/watch?v=lKTsv6iVxV4) 495 | - [一补数（1s Complement）](https://en.wikipedia.org/wiki/Ones%27_complement) 496 | - [补码（2s Complement）](https://en.wikipedia.org/wiki/Two%27s_complement) 497 | - [ ] 计算置位（Set Bits） 498 | - [计算一个字节中置位（Set Bits）的四种方式（视频）](https://youtu.be/Hzuzo9NJrlc) 499 | - [计算比特位](https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan) 500 | - [如何在一个 32 位的整型中计算置位（Set Bits）的数量](http://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer) 501 | - [ ] 四舍五入2的幂数： 502 | - [四舍五入到2的下一幂数](http://bits.stephan-brumme.com/roundUpToNextPowerOfTwo.html) 503 | - [ ] 交换值： 504 | - [交换（Swap）](http://bits.stephan-brumme.com/swap.html) 505 | - [ ] 绝对值： 506 | - [绝对整型（Absolute Integer）](http://bits.stephan-brumme.com/absInteger.html) 507 | 508 | ## 树（Trees） 509 | 510 | - ### 树 —— 笔记 & 背景 511 | - [ ] [系列：基本树（视频）](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees) 512 | - [ ] [系列：树（视频）](https://www.coursera.org/learn/data-structures/lecture/95qda/trees) 513 | - 基本的树形结构 514 | - 遍历 515 | - 操作算法 516 | - BFS（广度优先检索，breadth-first search） 517 | - [MIT（视频）](https://www.youtube.com/watch?v=s-CYnVz-uh4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=13) 518 | - 层序遍历（使用队列的 BFS 算法） 519 | - 时间复杂度： O(n) 520 | - 空间复杂度： 521 | - 最好情况： O(1) 522 | - 最坏情况：O(n/2)=O(n) 523 | - DFS（深度优先检索，depth-first search） 524 | - [MIT（视频）](https://www.youtube.com/watch?v=AfSk24UTFS8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=14) 525 | - 笔记： 526 | - 时间复杂度：O(n) 527 | - 空间复杂度： 528 | - 最好情况：O(log n) - 树的平均高度 529 | - 最坏情况：O(n) 530 | - 中序遍历（DFS：左、节点本身、右） 531 | - 后序遍历（DFS：左、右、节点本身） 532 | - 先序遍历（DFS：节点本身、左、右） 533 | 534 | - ### 二叉查找树（Binary search trees）：BSTs 535 | - [ ] [二叉查找树概览（视频）](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) 536 | - [ ] [系列（视频）](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/p82sw/core-introduction-to-binary-search-trees) 537 | - 从符号表开始到 BST 程序 538 | - [ ] [介绍（视频）](https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction) 539 | - [ ] [MIT（视频）](https://www.youtube.com/watch?v=9Jry5-82I68) 540 | - C/C++: 541 | - [ ] [二叉查找树 —— 在 C/C++ 中实现（视频）](https://www.youtube.com/watch?v=COZK7NATh4k&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=28) 542 | - [ ] [BST 的实现 —— 在堆栈和堆中的内存分配（视频）](https://www.youtube.com/watch?v=hWokyBoo0aI&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=29) 543 | - [ ] [在二叉查找树中找到最小和最大的元素（视频）](https://www.youtube.com/watch?v=Ut90klNN264&index=30&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) 544 | - [ ] [寻找二叉树的高度（视频）](https://www.youtube.com/watch?v=_pnqMz5nrRs&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=31) 545 | - [ ] [二叉树的遍历 —— 广度优先和深度优先策略（视频）](https://www.youtube.com/watch?v=9RHO6jU--GU&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=32) 546 | - [ ] [二叉树：层序遍历（视频）](https://www.youtube.com/watch?v=86g8jAQug04&index=33&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) 547 | - [ ] [二叉树的遍历：先序、中序、后序（视频）](https://www.youtube.com/watch?v=gm8DUJJhmY4&index=34&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) 548 | - [ ] [判断一棵二叉树是否为二叉查找树（视频）](https://www.youtube.com/watch?v=yEwSGhSsT0U&index=35&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) 549 | - [ ] [从二叉查找树中删除一个节点（视频）](https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36) 550 | - [ ] [二叉查找树中序遍历的后继者（视频）](https://www.youtube.com/watch?v=5cPbNCrdotA&index=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) 551 | - [ ] 实现： 552 | - [ ] insert // 往树上插值 553 | - [ ] get_node_count // 查找树上的节点数 554 | - [ ] print_values // 从小到大打印树中节点的值 555 | - [ ] delete_tree 556 | - [ ] is_in_tree // 如果值存在于树中则返回 true 557 | - [ ] get_height // 返回节点所在的高度（如果只有一个节点，那么高度则为1） 558 | - [ ] get_min // 返回树上的最小值 559 | - [ ] get_max // 返回树上的最大值 560 | - [ ] is_binary_search_tree 561 | - [ ] delete_value 562 | - [ ] get_successor // 返回给定值的后继者，若没有则返回-1 563 | 564 | - ### 堆（Heap） / 优先级队列（Priority Queue） / 二叉堆（Binary Heap） 565 | - 可视化是一棵树，但通常是以线性的形式存储（数组、链表） 566 | - [ ] [堆](https://en.wikipedia.org/wiki/Heap_(data_structure)) 567 | - [ ] [介绍（视频）](https://www.coursera.org/learn/data-structures/lecture/2OpTs/introduction) 568 | - [ ] [无知的实现（视频）](https://www.coursera.org/learn/data-structures/lecture/z3l9N/naive-implementations) 569 | - [ ] [二叉树（视频）](https://www.coursera.org/learn/data-structures/lecture/GRV2q/binary-trees) 570 | - [ ] [关于树高的讨论（视频）](https://www.coursera.org/learn/data-structures/supplement/S5xxz/tree-height-remark) 571 | - [ ] [基本操作（视频）](https://www.coursera.org/learn/data-structures/lecture/0g1dl/basic-operations) 572 | - [ ] [完全二叉树（视频）](https://www.coursera.org/learn/data-structures/lecture/gl5Ni/complete-binary-trees) 573 | - [ ] [伪代码（视频）](https://www.coursera.org/learn/data-structures/lecture/HxQo9/pseudocode) 574 | - [ ] [堆排序 —— 跳到起点（视频）](https://youtu.be/odNJmw5TOEE?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3291) 575 | - [ ] [堆排序（视频）](https://www.coursera.org/learn/data-structures/lecture/hSzMO/heap-sort) 576 | - [ ] [构建一个堆（视频）](https://www.coursera.org/learn/data-structures/lecture/dwrOS/building-a-heap) 577 | - [ ] [MIT：堆与堆排序（视频）](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) 578 | - [ ] [CS 61B Lecture 24：优先级队列（视频）](https://www.youtube.com/watch?v=yIUFT6AKBGE&index=24&list=PL4BBB74C7D2A1049C) 579 | - [ ] [构建线性时间复杂度的堆（大顶堆）](https://www.youtube.com/watch?v=MiyLo8adrWw) 580 | - [ ] 实现一个大顶堆： 581 | - [ ] insert 582 | - [ ] sift_up —— 用于插入元素 583 | - [ ] get_max —— 返回最大值但不移除元素 584 | - [ ] get_size() —— 返回存储的元素数量 585 | - [ ] is_empty() —— 若堆为空则返回 true 586 | - [ ] extract_max —— 返回最大值并移除 587 | - [ ] sift_down —— 用于获取最大值元素 588 | - [ ] remove(i) —— 删除指定索引的元素 589 | - [ ] heapify —— 构建堆，用于堆排序 590 | - [ ] heap_sort() —— 拿到一个未排序的数组，然后使用大顶堆进行就地排序 591 | - 注意：若用小顶堆可节省操作，但导致空间复杂度加倍。（无法做到就地） 592 | 593 | - ### 字典树（Tries） 594 | - 需要注意的是，字典树各式各样。有些有前缀，而有些则没有。有些使用字符串而不使用比特位来追踪路径。 595 | - 阅读代码，但不实现。 596 | - [ ] [数据结构笔记及编程技术](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries) 597 | - [ ] 短课程视频： 598 | - [ ] [对字典树的介绍（视频）](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08Xyf/core-introduction-to-tries) 599 | - [ ] [字典树的性能（视频）](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/PvlZW/core-performance-of-tries) 600 | - [ ] [实现一棵字典树（视频）](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie) 601 | - [ ] [字典树：一个被忽略的数据结构](https://www.toptal.com/java/the-trie-a-neglected-data-structure) 602 | - [ ] [高级编程 —— 使用字典树](https://www.topcoder.com/community/data-science/data-science-tutorials/using-tries/) 603 | - [ ] [标准教程（现实中的用例）（视频）](https://www.youtube.com/watch?v=TJ8SkcUSdbU) 604 | - [ ] [MIT，高阶数据结构，使用字符串追踪路径（可事半功倍）](https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf) 605 | 606 | - ### 平衡查找树（Balanced search trees） 607 | - 掌握至少一种平衡查找树（并懂得如何实现）： 608 | - “在各种平衡查找树当中，AVL 树和2-3树已经成为了过去，而红黑树（red-black trees）看似变得越来越受人青睐。这种令人特别感兴趣的数据结构，亦称伸展树（splay tree）。它可以自我管理，且会使用轮换来移除任何访问过根节点的 key。” —— Skiena 609 | - 因此，在各种各样的平衡查找树当中，我选择了伸展树来实现。虽然，通过我的阅读，我发现在 Google 的面试中并不会被要求实现一棵平衡查找树。但是，为了胜人一筹，我们还是应该看看如何去实现。在阅读了大量关于红黑树的代码后，我才发现伸展树的实现确实会使得各方面更为高效。 610 | - 伸展树：插入、查找、删除函数的实现，而如果你最终实现了红黑树，那么请尝试一下： 611 | - 跳过删除函数，直接实现搜索和插入功能 612 | - 我希望能阅读到更多关于 B 树的资料，因为它也被广泛地应用到大型的数据库当中。 613 | - [ ] [自平衡二叉查找树](https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree) 614 | 615 | - [ ] **AVL 树** 616 | - 实际中：我能告诉你的是，该种树并无太多的用途，但我能看到有用的地方在哪里：AVL 树是另一种平衡查找树结构。其可支持时间复杂度为 O(log n) 的查询、插入及删除。它比红黑树严格意义上更为平衡，从而导致插入和删除更慢，但遍历却更快。正因如此，才彰显其结构的魅力。只需要构建一次，就可以在不重新构造的情况下读取，适合于实现诸如语言字典（或程序字典，如一个汇编程序或解释程序的操作码）。 617 | - [ ] [MIT AVL 树 / AVL 树的排序（视频）](https://www.youtube.com/watch?v=FNeL18KsWPc&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=6) 618 | - [ ] [AVL 树（视频）](https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees) 619 | - [ ] [AVL 树的实现（视频）](https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation) 620 | - [ ] [分离与合并](https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge) 621 | 622 | - [ ] **伸展树** 623 | - 实际中：伸展树一般用于缓存、内存分配者、路由器、垃圾回收者、数据压缩、ropes（字符串的一种替代品，用于存储长串的文本字符）、Windows NT（虚拟内存、网络及文件系统）等的实现。 624 | - [ ] [CS 61B：伸展树（Splay trees）（视频）](https://www.youtube.com/watch?v=Najzh1rYQTo&index=23&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd) 625 | - [ ] MIT 教程：伸展树（Splay trees）： 626 | - 该教程会过于学术，但请观看到最后的10分钟以确保掌握。 627 | - [视频](https://www.youtube.com/watch?v=QnPl_Y6EqMo) 628 | 629 | - [ ] **2-3查找树** 630 | - 实际中：2-3树的元素插入非常快速，但却有着查询慢的代价（因为相比较 AVL 树来说，其高度更高）。 631 | - 你会很少用到2-3树。这是因为，其实现过程中涉及到不同类型的节点。因此，人们更多地会选择红黑树。 632 | - [ ] [2-3树的直感与定义（视频）](https://www.youtube.com/watch?v=C3SsdUqasD4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=2) 633 | - [ ] [2-3树的二元观点](https://www.youtube.com/watch?v=iYvBtGKsqSg&index=3&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) 634 | - [ ] [2-3树（学生叙述）（视频）](https://www.youtube.com/watch?v=TOb1tuEZ2X4&index=5&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) 635 | 636 | - [ ] **2-3-4树 (亦称2-4树)** 637 | - 实际中：对于每一棵2-4树，都有着对应的红黑树来存储同样顺序的数据元素。在2-4树上进行插入及删除操作等同于在红黑树上进行颜色翻转及轮换。这使得2-4树成为一种用于掌握红黑树背后逻辑的重要工具。这就是为什么许多算法引导文章都会在介绍红黑树之前，先介绍2-4树，尽管**2-4树在实际中并不经常使用**。 638 | - [ ] [CS 61B Lecture 26：平衡查找树（视频）](https://www.youtube.com/watch?v=zqrqYXkth6Q&index=26&list=PL4BBB74C7D2A1049C) 639 | - [ ] [自底向上的2-4树（视频）](https://www.youtube.com/watch?v=DQdMYevEyE4&index=4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) 640 | - [ ] [自顶向下的2-4树（视频）](https://www.youtube.com/watch?v=2679VQ26Fp4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=5) 641 | 642 | - [ ] **B 树** 643 | - 有趣的是：为啥叫 B 仍然是一个神秘。因为 B 可代表波音（Boeing）、平衡（Balanced）或 Bayer（联合创造者） 644 | - 实际中：B 树会被广泛适用于数据库中，而现代大多数的文件系统都会使用到这种树（或变种)。除了运用在数据库中，B 树也会被用于文件系统以快速访问一个文件的任意块。但存在着一个基本的问题，那就是如何将文件块 i 转换成一个硬盘块（或一个柱面-磁头-扇区）上的地址。 645 | - [ ] [B 树](https://en.wikipedia.org/wiki/B-tree) 646 | - [ ] [B 树的介绍（视频）](https://www.youtube.com/watch?v=I22wEC1tTGo&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=6) 647 | - [ ] [B 树的定义及其插入操作（视频）](https://www.youtube.com/watch?v=s3bCdZGrgpA&index=7&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) 648 | - [ ] [B 树的删除操作（视频）](https://www.youtube.com/watch?v=svfnVhJOfMc&index=8&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) 649 | - [ ] [MIT 6.851 —— 内存层次模块（Memory Hierarchy Models）（视频）](https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf) 650 | - 覆盖有高速缓存参数无关型（cache-oblivious）B 树和非常有趣的数据结构 651 | - 头37分钟讲述的很专业，或许可以跳过（B 指块的大小、即缓存行的大小） 652 | 653 | - [ ] **红黑树** 654 | - 实际中：红黑树提供了在最坏情况下插入操作、删除操作和查找操作的时间保证。这些时间值的保障不仅对时间敏感型应用有用，例如实时应用，还对在其他数据结构中块的构建非常有用，而这些数据结构都提供了最坏情况下的保障；例如，许多用于计算几何学的数据结构都可以基于红黑树，而目前 Linux 系统所采用的完全公平调度器（the Completely Fair Scheduler）也使用到了该种树。在 Java 8中，红黑树也被用于存储哈希列表集合中相同的数据，而不是使用链表及哈希码。 655 | - [ ] [Aduni —— 算法 —— 课程4（该链接直接跳到开始部分）（视频）](https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871) 656 | - [ ] [Aduni —— 算法 —— 课程5（视频）](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5) 657 | - [ ] [黑树（Black Tree）](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree) 658 | - [ ] [二分查找及红黑树的介绍](https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-binary-search-and-red-black-trees/) 659 | 660 | - ### N 叉树（K 叉树、M 叉树） 661 | - 注意：N 或 K 指的是分支系数（即树的最大分支数）： 662 | - 二叉树是一种分支系数为2的树 663 | - 2-3树是一种分支系数为3的树 664 | - [ ] [K 叉树](https://en.wikipedia.org/wiki/K-ary_tree) 665 | 666 | ## 排序（Sorting） 667 | 668 | - [ ] 笔记: 669 | - 实现各种排序 & 知道每种排序的最坏、最好和平均的复杂度分别是什么场景: 670 | - 不要用冒泡排序 - 大多数情况下效率感人 - 时间复杂度 O(n^2), 除非 n <= 16 671 | - [ ] 排序算法的稳定性 ("快排是稳定的么?") 672 | - [排序算法的稳定性](https://en.wikipedia.org/wiki/Sorting_algorithm#Stability) 673 | - [排序算法的稳定性](http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms) 674 | - [排序算法的稳定性](http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms) 675 | - [排序算法的稳定性](http://www.geeksforgeeks.org/stability-in-sorting-algorithms/) 676 | - [排序算法 - 稳定性](http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/stability.pdf) 677 | - [ ] 哪种排序算法可以用链表？哪种用数组？哪种两者都可？ 678 | - 并不推荐对一个链表排序，但归并排序是可行的. 679 | - [链表的归并排序](http://www.geeksforgeeks.org/merge-sort-for-linked-list/) 680 | 681 | - 关于堆排序，请查看前文堆的数据结构部分。堆排序很强大，不过是非稳定排序。 682 | 683 | - [ ] [冒泡排序 (video)](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB) 684 | - [ ] [冒泡排序分析 (video)](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB) 685 | - [ ] [插入排序 & 归并排序 (video)](https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) 686 | - [ ] [插入排序 (video)](https://www.youtube.com/watch?v=c4BRHC7kTaQ&index=2&list=PL89B61F78B552C1AB) 687 | - [ ] [归并排序 (video)](https://www.youtube.com/watch?v=GCae1WNvnZM&index=3&list=PL89B61F78B552C1AB) 688 | - [ ] [快排 (video)](https://www.youtube.com/watch?v=y_G9BkAm6B8&index=4&list=PL89B61F78B552C1AB) 689 | - [ ] [选择排序 (video)](https://www.youtube.com/watch?v=6nDMgr0-Yyo&index=8&list=PL89B61F78B552C1AB) 690 | 691 | - [ ] 斯坦福大学关于排序算法的视频: 692 | - [ ] [课程 15 | 编程抽象 (video)](https://www.youtube.com/watch?v=ENp00xylP7c&index=15&list=PLFE6E58F856038C69) 693 | - [ ] [课程 16 | 编程抽象 (video)](https://www.youtube.com/watch?v=y4M9IVgrVKo&index=16&list=PLFE6E58F856038C69) 694 | 695 | - [ ] Shai Simonson 视频, [Aduni.org](http://www.aduni.org/): 696 | - [ ] [算法 - 排序 - 第二讲 (video)](https://www.youtube.com/watch?v=odNJmw5TOEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=2) 697 | - [ ] [算法 - 排序2 - 第三讲 (video)](https://www.youtube.com/watch?v=hj8YKFTFKEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=3) 698 | 699 | - [ ] Steven Skiena 关于排序的视频: 700 | - [ ] [课程从 26:46 开始 (video)](https://youtu.be/ute-pmMkyuk?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=1600) 701 | - [ ] [课程从 27:40 开始 (video)](https://www.youtube.com/watch?v=yLvp-pB8mak&index=8&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) 702 | - [ ] [课程从 35:00 开始 (video)](https://www.youtube.com/watch?v=q7K9otnzlfE&index=9&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) 703 | - [ ] [课程从 23:50 开始 (video)](https://www.youtube.com/watch?v=TvqIGu9Iupw&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=10) 704 | 705 | - [ ] 加州大学伯克利分校（UC Berkeley） 大学课程: 706 | - [ ] [CS 61B 课程 29: 排序 I (video)](https://www.youtube.com/watch?v=EiUvYS2DT6I&list=PL4BBB74C7D2A1049C&index=29) 707 | - [ ] [CS 61B 课程 30: 排序 II (video)](https://www.youtube.com/watch?v=2hTY3t80Qsk&list=PL4BBB74C7D2A1049C&index=30) 708 | - [ ] [CS 61B 课程 32: 排序 III (video)](https://www.youtube.com/watch?v=Y6LOLpxg6Dc&index=32&list=PL4BBB74C7D2A1049C) 709 | - [ ] [CS 61B 课程 33: 排序 V (video)](https://www.youtube.com/watch?v=qNMQ4ly43p4&index=33&list=PL4BBB74C7D2A1049C) 710 | 711 | - [ ] - 归并排序: 712 | - [ ] [使用外部数组](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/sorting/mergesort.c) 713 | - [ ] [对原数组直接排序](https://github.com/jwasham/practice-cpp/blob/master/merge_sort/merge_sort.cc) 714 | - [ ] - 快速排序: 715 | - [ ] [实现](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/randomization/quick.c) 716 | - [ ] [实现](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c) 717 | 718 | - [ ] 实现: 719 | - [ ] 归并：平均和最差情况的时间复杂度为 O(n log n)。 720 | - [ ] 快排：平均时间复杂度为 O(n log n)。 721 | - 选择排序和插入排序的最坏、平均时间复杂度都是 O(n^2)。 722 | - 关于堆排序，请查看前文堆的数据结构部分。 723 | 724 | - [ ] 有兴趣的话，还有一些补充 - 但并不是必须的: 725 | - [ ] [基数排序](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#radixSort) 726 | - [ ] [基数排序 (video)](https://www.youtube.com/watch?v=xhr26ia4k38) 727 | - [ ] [基数排序, 计数排序 (线性时间内) (video)](https://www.youtube.com/watch?v=Nz1KZXbghj8&index=7&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) 728 | - [ ] [随机算法: 矩阵相乘, 快排, Freivalds' 算法 (video)](https://www.youtube.com/watch?v=cNB2lADK3_s&index=8&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) 729 | - [ ] [线性时间内的排序 (video)](https://www.youtube.com/watch?v=pOKy3RZbSws&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=14) 730 | 731 | ## 图（Graphs） 732 | 733 | 图论能解决计算机科学里的很多问题，所以这一节会比较长，像树和排序的部分一样。 734 | 735 | - Yegge 的笔记: 736 | - 有 3 种基本方式在内存里表示一个图: 737 | - 对象和指针 738 | - 矩阵 739 | - 邻接表 740 | - 熟悉以上每一种图的表示法，并了解各自的优缺点 741 | - 宽度优先搜索和深度优先搜索 - 知道它们的计算复杂度和设计上的权衡以及如何用代码实现它们 742 | - 遇到一个问题时，首先尝试基于图的解决方案，如果没有再去尝试其他的。 743 | 744 | - [ ] Skiena 教授的课程 - 很不错的介绍: 745 | - [ ] [CSE373 2012 - 课程 11 - 图的数据结构 (video)](https://www.youtube.com/watch?v=OiXxhDrFruw&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=11) 746 | - [ ] [CSE373 2012 - 课程 12 - 广度优先搜索 (video)](https://www.youtube.com/watch?v=g5vF8jscteo&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=12) 747 | - [ ] [CSE373 2012 - 课程 13 - 图的算法 (video)](https://www.youtube.com/watch?v=S23W6eTcqdY&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=13) 748 | - [ ] [CSE373 2012 - 课程 14 - 图的算法 (1) (video)](https://www.youtube.com/watch?v=WitPBKGV0HY&index=14&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) 749 | - [ ] [CSE373 2012 - 课程 15 - 图的算法 (2) (video)](https://www.youtube.com/watch?v=ia1L30l7OIg&index=15&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) 750 | - [ ] [CSE373 2012 - 课程 16 - 图的算法 (3) (video)](https://www.youtube.com/watch?v=jgDOQq6iWy8&index=16&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) 751 | 752 | - [ ] 图 (复习和其他): 753 | 754 | - [ ] [6.006 单源最短路径问题 (video)](https://www.youtube.com/watch?v=Aa2sqUhIn-E&index=15&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) 755 | - [ ] [6.006 Dijkstra 算法 (video)](https://www.youtube.com/watch?v=2E7MmKv0Y24&index=16&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) 756 | - [ ] [6.006 Bellman-Ford 算法(video)](https://www.youtube.com/watch?v=ozsuci5pIso&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=17) 757 | - [ ] [6.006 Dijkstra 效率优化 (video)](https://www.youtube.com/watch?v=CHvQ3q_gJ7E&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=18) 758 | - [ ] [Aduni: 图的算法 I - 拓扑排序, 最小生成树, Prim 算法 - 第六课 (video)]( https://www.youtube.com/watch?v=i_AQT_XfvD8&index=6&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) 759 | - [ ] [Aduni: 图的算法 II - 深度优先搜索, 广度优先搜索, Kruskal 算法, 并查集数据结构 - 第七课 (video)]( https://www.youtube.com/watch?v=ufj5_bppBsA&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=7) 760 | - [ ] [Aduni: 图的算法 III: 最短路径 - 第八课 (video)](https://www.youtube.com/watch?v=DiedsPsMKXc&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=8) 761 | - [ ] [Aduni: 图的算法. IV: 几何算法介绍 - 第九课 (video)](https://www.youtube.com/watch?v=XIAQRlNkJAw&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=9) 762 | - [ ] [CS 61B 2014 (从 58:09 开始) (video)](https://youtu.be/dgjX4HdMI-Q?list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&t=3489) 763 | - [ ] [CS 61B 2014: 加权图 (video)](https://www.youtube.com/watch?v=aJjlQCFwylA&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=19) 764 | - [ ] [贪心算法: 最小生成树 (video)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) 765 | - [ ] [图的算法之强连通分量 Kosaraju 算法 (video)](https://www.youtube.com/watch?v=RpgcYiky7uw) 766 | 767 | - 完整的 Coursera 课程: 768 | - [ ] [图的算法 (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome) 769 | 770 | - Yegge: 如果有机会，可以试试研究更酷炫的算法: 771 | - [ ] Dijkstra 算法 - 上文 - 6.006 772 | - [ ] A* 算法 773 | - [ ] [A* 算法](https://en.wikipedia.org/wiki/A*_search_algorithm) 774 | - [ ] [A* 寻路教程 (video)](https://www.youtube.com/watch?v=KNXfSOx4eEE) 775 | - [ ] [A* 寻路 (E01: 算法解释) (video)](https://www.youtube.com/watch?v=-L-WgKMFuhE) 776 | 777 | - 我会实现: 778 | - [ ] DFS 邻接表 (递归) 779 | - [ ] DFS 邻接表 (栈迭代) 780 | - [ ] DFS 邻接矩阵 (递归) 781 | - [ ] DFS 邻接矩阵 (栈迭代) 782 | - [ ] BFS 邻接表 783 | - [ ] BFS 邻接矩阵 784 | - [ ] 单源最短路径问题 (Dijkstra) 785 | - [ ] 最小生成树 786 | - 基于 DFS 的算法 (根据上文 Aduni 的视频): 787 | - [ ] 检查环 (我们会先检查是否有环存在以便做拓扑排序) 788 | - [ ] 拓扑排序 789 | - [ ] 计算图中的连通分支 790 | - [ ] 列出强连通分量 791 | - [ ] 检查双向图 792 | 793 | 可以从 Skiena 的书（参考下面的书推荐小节）和面试书籍中学习更多关于图的实践。 794 | 795 | ## 更多知识 796 | 797 | - ### 递归（Recursion） 798 | - [ ] Stanford 大学关于递归 & 回溯的课程: 799 | - [ ] [课程 8 | 抽象编程 (video)](https://www.youtube.com/watch?v=gl3emqCuueQ&list=PLFE6E58F856038C69&index=8) 800 | - [ ] [课程 9 | 抽象编程 (video)](https://www.youtube.com/watch?v=uFJhEPrbycQ&list=PLFE6E58F856038C69&index=9) 801 | - [ ] [课程 10 | 抽象编程 (video)](https://www.youtube.com/watch?v=NdF1QDTRkck&index=10&list=PLFE6E58F856038C69) 802 | - [ ] [课程 11 | 抽象编程 (video)](https://www.youtube.com/watch?v=p-gpaIGRCQI&list=PLFE6E58F856038C69&index=11) 803 | - 什么时候适合使用 804 | - 尾递归会更好么? 805 | - [ ] [什么是尾递归以及为什么它如此糟糕?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad) 806 | - [ ] [尾递归 (video)](https://www.youtube.com/watch?v=L1jjXGfxozc) 807 | 808 | - ### 动态规划（Dynamic Programming） 809 | - This subject can be pretty difficult, as each DP soluble problem must be defined as a recursion relation, and coming up with it can be tricky. 810 | - 这一部分会有点困难，每个可以用动态规划解决的问题都必须先定义出递推关系，要推导出来可能会有点棘手。 811 | - 我建议先阅读和学习足够多的动态规划的例子，以便对解决 DP 问题的一般模式有个扎实的理解。 812 | 813 | - [ ] 视频: 814 | - Skiena 的视频可能会有点难跟上，有时候他用白板写的字会比较小，难看清楚。 815 | - [ ] [Skiena: CSE373 2012 - 课程 19 - 动态规划介绍 (video)](https://youtu.be/Qc2ieXRgR0k?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=1718) 816 | - [ ] [Skiena: CSE373 2012 - 课程 20 - 编辑距离 (video)](https://youtu.be/IsmMhMdyeGY?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=2749) 817 | - [ ] [Skiena: CSE373 2012 - 课程 21 - 动态规划举例 (video)](https://youtu.be/o0V9eYF4UI8?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=406) 818 | - [ ] [Skiena: CSE373 2012 - 课程 22 - 动态规划应用 (video)](https://www.youtube.com/watch?v=dRbMC1Ltl3A&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=22) 819 | - [ ] [Simonson: 动态规划 0 (starts at 59:18) (video)](https://youtu.be/J5aJEcOr6Eo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3558) 820 | - [ ] [Simonson: 动态规划 I - 课程 11 (video)](https://www.youtube.com/watch?v=0EzHjQ_SOeU&index=11&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) 821 | - [ ] [Simonson: 动态规划 II - 课程 12 (video)](https://www.youtube.com/watch?v=v1qiRwuJU7g&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=12) 822 | - [ ] 单独的 DP 问题 (每一个视频都很短): 823 | [动态规划 (video)](https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr) 824 | - [ ] Yale 课程笔记: 825 | - [ ] [动态规划](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#dynamicProgramming) 826 | - [ ] Coursera 课程: 827 | - [ ] [RNA 二级结构问题 (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/80RrW/the-rna-secondary-structure-problem) 828 | - [ ] [动态规划算法 (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/PSonq/a-dynamic-programming-algorithm) 829 | - [ ] [DP 算法描述 (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/oUEK2/illustrating-the-dp-algorithm) 830 | - [ ] [DP 算法的运行时间 (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/nfK2r/running-time-of-the-dp-algorithm) 831 | - [ ] [DP vs 递归实现 (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/M999a/dp-vs-recursive-implementation) 832 | - [ ] [全局成对序列排列 (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/UZ7o6/global-pairwise-sequence-alignment) 833 | - [ ] [本地成对序列排列 (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/WnNau/local-pairwise-sequence-alignment) 834 | 835 | - ### 组合（Combinatorics） (n 中选 k 个) & 概率（Probability） 836 | - [ ] [数据技巧: 如何找出阶乘、排列和组合(选择) (video)](https://www.youtube.com/watch?v=8RRo6Ti9d0U) 837 | - [ ] [来点学校的东西: 概率 (video)](https://www.youtube.com/watch?v=sZkAAk9Wwa4) 838 | - [ ] [来点学校的东西: 概率和马尔可夫链 (video)](https://www.youtube.com/watch?v=dNaJg-mLobQ) 839 | - [ ] 可汗学院: 840 | - 课程设置: 841 | - [ ] [概率理论基础](https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic) 842 | - 视频 - 41 (每一个都短小精悍): 843 | - [ ] [概率解释 (video)](https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19) 844 | 845 | - ### NP, NP-完全和近似算法 846 | - 知道最经典的一些 NP 完全问题，比如旅行商问题和背包问题, 847 | 而且能在面试官试图忽悠你的时候识别出他们。 848 | - 知道 NP 完全是什么意思. 849 | - [ ] [计算复杂度 (video)](https://www.youtube.com/watch?v=moPtwq_cVH8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=23) 850 | - [ ] Simonson: 851 | - [ ] [贪心算法. II & 介绍 NP-完全性 (video)](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939) 852 | - [ ] [NP-完全性 II & 归约 (video)](https://www.youtube.com/watch?v=e0tGC6ZQdQE&index=16&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) 853 | - [ ] [NP-完全性 III (Video)](https://www.youtube.com/watch?v=fCX1BGT3wjE&index=17&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) 854 | - [ ] [NP-完全性 IV (video)](https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=18) 855 | - [ ] Skiena: 856 | - [ ] [CSE373 2012 - 课程 23 - 介绍 NP-完全性 IV (video)](https://youtu.be/KiK5TVgXbFg?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=1508) 857 | - [ ] [CSE373 2012 - 课程 24 - NP-完全性证明 (video)](https://www.youtube.com/watch?v=27Al52X3hd4&index=24&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) 858 | - [ ] [CSE373 2012 - 课程 25 - NP-完全性挑战 (video)](https://www.youtube.com/watch?v=xCPH4gwIIXM&index=25&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) 859 | - [ ] [复杂度: P, NP, NP-完全性, 规约 (video)](https://www.youtube.com/watch?v=eHZifpgyH_4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=22) 860 | - [ ] [复杂度: 近视算法 Algorithms (video)](https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=24) 861 | - [ ] [复杂度: 固定参数算法 (video)](https://www.youtube.com/watch?v=4q-jmGrmxKs&index=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) 862 | - Peter Norvik 讨论旅行商问题的近似最优解: 863 | - [Jupyter 笔记本](http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb) 864 | - 《算法导论》的第 1048 - 1140 页。 865 | 866 | - ### 缓存（Cache） 867 | - [ ] LRU 缓存: 868 | - [ ] [LRU 的魔力 (100 Days of Google Dev) (video)](https://www.youtube.com/watch?v=R5ON3iwx78M) 869 | - [ ] [实现 LRU (video)](https://www.youtube.com/watch?v=bq6N7Ym81iI) 870 | - [ ] [LeetCode - 146 LRU Cache (C++) (video)](https://www.youtube.com/watch?v=8-FZRAjR7qU) 871 | - [ ] CPU 缓存: 872 | - [ ] [MIT 6.004 L15: 存储体系 (video)](https://www.youtube.com/watch?v=vjYF_fAZI5E&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-&index=24) 873 | - [ ] [MIT 6.004 L16: 缓存的问题 (video)](https://www.youtube.com/watch?v=ajgC3-pyGlk&index=25&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-) 874 | 875 | - ### 进程（Processe）和线程（Thread） 876 | - [ ] 计算机科学 162 - 操作系统 (25 个视频): 877 | - 视频 1-11 是关于进程和线程 878 | - [操作系统和系统编程 (video)](https://www.youtube.com/playlist?list=PL-XXv-cvA_iBDyz-ba4yDskqMDY6A1w_c) 879 | - [进程和线程的区别是什么?](https://www.quora.com/What-is-the-difference-between-a-process-and-a-thread) 880 | - 涵盖了: 881 | - 进程、线程、协程 882 | - 进程和线程的区别 883 | - 进程 884 | - 线程 885 | - 锁 886 | - 互斥 887 | - 信号量 888 | - 监控 889 | - 他们是如何工作的 890 | - 死锁 891 | - 活锁 892 | - CPU 活动, 中断, 上下文切换 893 | - 现代多核处理器的并发式结构 894 | - 进程资源需要（内存：代码、静态存储器、栈、堆、文件描述符、I/O） 895 | - 线程资源需要（在同一个进程内和其他线程共享以上的资源，但是每个线程都有独立的程序计数器、栈计数器、寄存器和栈） 896 | - Fork 操作是真正的写时复制（只读），直到新的进程写到内存中，才会生成一份新的拷贝。 897 | - 上下文切换 898 | - 操作系统和底层硬件是如何初始化上下文切换的。 899 | - [ ] [C++ 的线程 (系列 - 10 个视频)](https://www.youtube.com/playlist?list=PL5jc9xFGsL8E12so1wlMS0r0hTQoJL74M) 900 | - [ ] Python 的协程 (视频): 901 | - [ ] [线程系列](https://www.youtube.com/playlist?list=PL1H1sBF1VAKVMONJWJkmUh6_p8g4F2oy1) 902 | - [ ] [Python 线程](https://www.youtube.com/watch?v=Bs7vPNbB9JM) 903 | - [ ] [理解 Python 的 GIL (2010)](https://www.youtube.com/watch?v=Obt-vMVdM8s) 904 | - [参考](http://www.dabeaz.com/GIL) 905 | - [ ] [David Beazley - Python 协程 - PyCon 2015](https://www.youtube.com/watch?v=MCs5OvhV9S4) 906 | - [ ] [Keynote David Beazley - 兴趣主题 (Python 异步 I/O)](https://www.youtube.com/watch?v=ZzfHjytDceU) 907 | - [ ] [Python 中的互斥](https://www.youtube.com/watch?v=0zaPs8OtyKY) 908 | 909 | 910 | 系统设计以及可伸缩性，要把软硬件的伸缩性设计的足够好有很多的东西要考虑，所以这是个包含非常多内容和资源的大主题。需要花费相当多的时间在这个主题上。 911 | 912 | - ### 系统设计、可伸缩性、数据处理 913 | - Yegge 的注意事项: 914 | - 伸缩性 915 | - 把大数据集提取为单一值 916 | - 大数据集转换 917 | - 处理大量的数据集 918 | - 系统 919 | - 特征集 920 | - 接口 921 | - 类层次结构 922 | - 在特定的约束下设计系统 923 | - 轻量和健壮性 924 | - 权衡和折衷 925 | - 性能分析和优化 926 | - [ ] **从这里开始**: [HiredInTech：系统设计](http://www.hiredintech.com/system-design/) 927 | - [ ] [该如何为技术面试里设计方面的问题做准备?](https://www.quora.com/How-do-I-prepare-to-answer-design-questions-in-a-technical-interview?redirected_qid=1500023) 928 | - [ ] [在系统设计面试前必须知道的 8 件事](http://blog.gainlo.co/index.php/2015/10/22/8-things-you-need-to-know-before-system-design-interviews/) 929 | - [ ] [算法设计](http://www.hiredintech.com/algorithm-design/) 930 | - [ ] [数据库范式 - 1NF, 2NF, 3NF and 4NF (video)](https://www.youtube.com/watch?v=UrYLYV7WSHM) 931 | - [ ] [系统设计面试](https://github.com/checkcheckzz/system-design-interview) - 这一部分有很多的资源，浏览一下我放在下面的文章和例子。 932 | - [ ] [如何在系统设计面试中脱颖而出](http://www.palantir.com/2011/10/how-to-rock-a-systems-design-interview/) 933 | - [ ] [每个人都该知道的一些数字](http://everythingisdata.wordpress.com/2009/10/17/numbers-everyone-should-know/) 934 | - [ ] [上下文切换操作会耗费多少时间?](http://blog.tsunanet.net/2010/11/how-long-does-it-take-to-make-context.html) 935 | - [ ] [跨数据中心的事务 (video)](https://www.youtube.com/watch?v=srOgpXECblk) 936 | - [ ] [简明 CAP 理论介绍](http://ksat.me/a-plain-english-introduction-to-cap-theorem/) 937 | - [ ] Paxos 一致性算法: 938 | - [时间很短](https://www.youtube.com/watch?v=s8JqcZtvnsM) 939 | - [用例 和 multi-paxos](https://www.youtube.com/watch?v=JEpsBg0AO6o) 940 | - [论文](http://research.microsoft.com/en-us/um/people/lamport/pubs/paxos-simple.pdf) 941 | - [ ] [一致性哈希](http://www.tom-e-white.com/2007/11/consistent-hashing.html) 942 | - [ ] [NoSQL 模式](http://horicky.blogspot.com/2009/11/nosql-patterns.html) 943 | - [ ] [OOSE: UML 2.0 系列 (video)](https://www.youtube.com/watch?v=OkC7HKtiZC0&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc) 944 | - [ ] OOSE: 使用 UML 和 Java 开发软件 (21 videos): 945 | - 如果你对 OO 都深刻的理解和实践，可以跳过这部分。 946 | - [OOSE: 使用 UML 和 Java 开发软件](https://www.youtube.com/playlist?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO) 947 | - [ ] 面向对象编程的 SOLID 原则: 948 | - [ ] [Bob Martin 面向对象的 SOLID 原则和敏捷设计 (video)](https://www.youtube.com/watch?v=TMuno5RZNeE) 949 | - [ ] [C# SOLID 设计模式 (video)](https://www.youtube.com/playlist?list=PL8m4NUhTQU48oiGCSgCP1FiJEcg_xJzyQ) 950 | - [ ] [SOLID 原则 (video)](https://www.youtube.com/playlist?list=PL4CE9F710017EA77A) 951 | - [ ] S - [单一职责原则](http://www.oodesign.com/single-responsibility-principle.html) | [每个对象的单一职责](http://www.javacodegeeks.com/2011/11/solid-single-responsibility-principle.html) 952 | - [更多](https://docs.google.com/open?id=0ByOwmqah_nuGNHEtcU5OekdDMkk) 953 | - [ ] O - [开闭原则](http://www.oodesign.com/open-close-principle.html) | [生产环境里的对象应该为扩展做准备而不是为更改](https://en.wikipedia.org/wiki/Open/closed_principle) 954 | - [更多](http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BwhCYaYDn8EgN2M5MTkwM2EtNWFkZC00ZTI3LWFjZTUtNTFhZGZiYmUzODc1&hl=en) 955 | - [ ] L - [里氏代换原则](http://www.oodesign.com/liskov-s-substitution-principle.html) | [基类和继承类遵循 ‘IS A’ 原则](http://stackoverflow.com/questions/56860/what-is-the-liskov-substitution-principle) 956 | - [更多](http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BwhCYaYDn8EgNzAzZjA5ZmItNjU3NS00MzQ5LTkwYjMtMDJhNDU5ZTM0MTlh&hl=en) 957 | - [ ] I - [接口隔离原则](http://www.oodesign.com/interface-segregation-principle.html) | 客户端被迫实现用不到的接口 958 | - [5 分钟讲解接口隔离原则 (video)](https://www.youtube.com/watch?v=3CtAfl7aXAQ) 959 | - [更多](http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BwhCYaYDn8EgOTViYjJhYzMtMzYxMC00MzFjLWJjMzYtOGJiMDc5N2JkYmJi&hl=en) 960 | - [ ] D -[依赖反转原则](http://www.oodesign.com/dependency-inversion-principle.html) | 减少对象里的依赖。 961 | - [什么是依赖倒置以及它为什么重要](http://stackoverflow.com/questions/62539/what-is-the-dependency-inversion-principle-and-why-is-it-important) 962 | - [更多](http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BwhCYaYDn8EgMjdlMWIzNGUtZTQ0NC00ZjQ5LTkwYzQtZjRhMDRlNTQ3ZGMz&hl=en) 963 | - [ ] 可伸缩性: 964 | - [ ] [很棒的概述 (video)](https://www.youtube.com/watch?v=-W9F__D3oY4) 965 | - [ ] 简短系列: 966 | - [克隆](http://www.lecloud.net/post/7295452622/scalability-for-dummies-part-1-clones) 967 | - [数据库](http://www.lecloud.net/post/7994751381/scalability-for-dummies-part-2-database) 968 | - [缓存](http://www.lecloud.net/post/9246290032/scalability-for-dummies-part-3-cache) 969 | - [异步](http://www.lecloud.net/post/9699762917/scalability-for-dummies-part-4-asynchronism) 970 | - [ ] [可伸缩的 Web 架构和分布式系统](http://www.aosabook.org/en/distsys.html) 971 | - [ ] [错误的分布式系统解释](https://pages.cs.wisc.edu/~zuyu/files/fallacies.pdf) 972 | - [ ] [实用编程技术](http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html) 973 | - [extra: Google Pregel 图形处理](http://horicky.blogspot.com/2010/07/google-pregel-graph-processing.html) 974 | - [ ] [Jeff Dean - 在 Goolge 构建软件系统 (video)](https://www.youtube.com/watch?v=modXC5IWTJI) 975 | - [ ] [可伸缩系统架构设计介绍](http://lethain.com/introduction-to-architecting-systems-for-scale/) 976 | - [ ] [使用 App Engine 和云存储扩展面向全球用户的手机游戏架构实践(video)](https://www.youtube.com/watch?v=9nWyWwY2Onc) 977 | - [ ] [How Google Does Planet-Scale Engineering for Planet-Scale Infra (video)](https://www.youtube.com/watch?v=H4vMcD7zKM0) 978 | - [ ] [算法的重要性](https://www.topcoder.com/community/data-science/data-science-tutorials/the-importance-of-algorithms/) 979 | - [ ] [分片](http://highscalability.com/blog/2009/8/6/an-unorthodox-approach-to-database-design-the-coming-of-the.html) 980 | - [ ] [Facebook 系统规模扩展实践 (2009)](https://www.infoq.com/presentations/Scale-at-Facebook) 981 | - [ ] [Facebook 系统规模扩展实践 (2012), "为 10 亿用户构建" (video)](https://www.youtube.com/watch?v=oodS71YtkGU) 982 | - [ ] [Long Game 工程实践 - Astrid Atkinson Keynote(video)](https://www.youtube.com/watch?v=p0jGmgIrf_M&list=PLRXxvay_m8gqVlExPC5DG3TGWJTaBgqSA&index=4) 983 | - [ ] [30 分钟看完 YouTuBe 7 年系统扩展经验](http://highscalability.com/blog/2012/3/26/7-years-of-youtube-scalability-lessons-in-30-minutes.html) 984 | - [video](https://www.youtube.com/watch?v=G-lGCC4KKok) 985 | - [ ] [PayPal 如何用 8 台虚拟机扛住 10 亿日交易量系统](http://highscalability.com/blog/2016/8/15/how-paypal-scaled-to-billions-of-transactions-daily-using-ju.html) 986 | - [ ] [如何对大数据集去重](https://blog.clevertap.com/how-to-remove-duplicates-in-large-datasets/) 987 | - [ ] [Etsy 的扩展和工程文化探究 Jon Cowie (video)](https://www.youtube.com/watch?v=3vV4YiqKm1o) 988 | - [ ] [是什么造就了 Amazon 自己的微服务架构](http://thenewstack.io/led-amazon-microservices-architecture/) 989 | - [ ] [压缩还是不压缩，是 Uber 面临的问题](https://eng.uber.com/trip-data-squeeze/) 990 | - [ ] [异步 I/O Tarantool 队列](http://highscalability.com/blog/2016/3/3/asyncio-tarantool-queue-get-in-the-queue.html) 991 | - [ ] [什么时候应该用近视查询处理?](http://highscalability.com/blog/2016/2/25/when-should-approximate-query-processing-be-used.html) 992 | - [ ] [Google 从单数据中心到故障转移, 到本地多宿主架构的演变]( http://highscalability.com/blog/2016/2/23/googles-transition-from-single-datacenter-to-failover-to-a-n.html) 993 | - [ ] [Spanner](http://highscalability.com/blog/2012/9/24/google-spanners-most-surprising-revelation-nosql-is-out-and.html) 994 | - [ ] [Egnyte: 构建和扩展 PB 级分布式系统架构的经验教训](http://highscalability.com/blog/2016/2/15/egnyte-architecture-lessons-learned-in-building-and-scaling.html) 995 | - [ ] [机器学习驱动的编程: 新世界的新编程方式](http://highscalability.com/blog/2016/7/6/machine-learning-driven-programming-a-new-programming-for-a.html) 996 | - [ ] [日服务数百万请求的图像优化技术](http://highscalability.com/blog/2016/6/15/the-image-optimization-technology-that-serves-millions-of-re.html) 997 | - [ ] [Patreon 架构](http://highscalability.com/blog/2016/2/1/a-patreon-architecture-short.html) 998 | - [ ] [Tinder: 推荐引擎是如何决定下一个你将会看到谁的?](http://highscalability.com/blog/2016/1/27/tinder-how-does-one-of-the-largest-recommendation-engines-de.html) 999 | - [ ] [现代缓存设计](http://highscalability.com/blog/2016/1/25/design-of-a-modern-cache.html) 1000 | - [ ] [Facebook 实时视频流扩展](http://highscalability.com/blog/2016/1/13/live-video-streaming-at-facebook-scale.html) 1001 | - [ ] [在 Amazon AWS 上把服务扩展到 1100 万量级的新手教程](http://highscalability.com/blog/2016/1/11/a-beginners-guide-to-scaling-to-11-million-users-on-amazons.html) 1002 | - [ ] [对延时敏感的应用是否应该使用 Docker?](http://highscalability.com/blog/2015/12/16/how-does-the-use-of-docker-effect-latency.html) 1003 | - [ ] [AMP（Accelerated Mobile Pages）的存在是对 Google 的威胁么?](http://highscalability.com/blog/2015/12/14/does-amp-counter-an-existential-threat-to-google.html) 1004 | - [ ] [360 度解读 Netflix 技术栈](http://highscalability.com/blog/2015/11/9/a-360-degree-view-of-the-entire-netflix-stack.html) 1005 | - [ ] [延迟无处不在 - 如何搞定它？](http://highscalability.com/latency-everywhere-and-it-costs-you-sales-how-crush-it) 1006 | - [ ] [无服务器架构](http://martinfowler.com/articles/serverless.html) 1007 | - [ ] [是什么驱动着 Instagram: 上百个实例、几十种技术](http://instagram-engineering.tumblr.com/post/13649370142/what-powers-instagram-hundreds-of-instances) 1008 | - [ ] [Cinchcast 架构 - 每天处理 1500 小时的音频](http://highscalability.com/blog/2012/7/16/cinchcast-architecture-producing-1500-hours-of-audio-every-d.html) 1009 | - [ ] [Justin.Tv 实时视频播放架构](http://highscalability.com/blog/2010/3/16/justintvs-live-video-broadcasting-architecture.html) 1010 | - [ ] [Playfish's 社交游戏架构 - 每月五千万用户增长](http://highscalability.com/blog/2010/9/21/playfishs-social-gaming-architecture-50-million-monthly-user.html) 1011 | - [ ] [猫途鹰架构 - 40 万访客, 200 万动态页面访问, 30TB 数据](http://highscalability.com/blog/2011/6/27/tripadvisor-architecture-40m-visitors-200m-dynamic-page-view.html) 1012 | - [ ] [PlentyOfFish 架构](http://highscalability.com/plentyoffish-architecture) 1013 | - [ ] [Salesforce 架构 - 如何扛住 13 亿日交易量](http://highscalability.com/blog/2013/9/23/salesforce-architecture-how-they-handle-13-billion-transacti.html) 1014 | - [ ] [ESPN's 架构扩展](http://highscalability.com/blog/2013/11/4/espns-architecture-at-scale-operating-at-100000-duh-nuh-nuhs.html) 1015 | - [ ] 下面 『消息、序列化和消息系统』部分的内容会提到什么样的技术能把各种服务整合到一起 1016 | - [ ] Twitter: 1017 | - [O'Reilly MySQL CE 2011: Jeremy Cole, "Big and Small Data at @Twitter" (video)](https://www.youtube.com/watch?v=5cKTP36HVgI) 1018 | - [时间线的扩展](https://www.infoq.com/presentations/Twitter-Timeline-Scalability) 1019 | - 更多内容可以查看视频部分的『大规模数据挖掘』视频系列。 1020 | - [ ] 系统设计问题练习：下面有一些指导原则，每一个都有相关文档以及在现实中该如何处理。 1021 | - 复习: [HiredInTech 的系统设计](http://www.hiredintech.com/system-design/) 1022 | - [cheat sheet](https://github.com/jwasham/google-interview-university/blob/master/extras/cheat%20sheets/system-design.pdf) 1023 | - 流程: 1024 | 1. 理解问题和范围: 1025 | - 在面试官的帮助下定义用例 1026 | - 提出附加功能的建议 1027 | - 去掉面试官认定范围以外的内容 1028 | - 假定高可用是必须的，而且要作为一个用例 1029 | 2. 考虑约束: 1030 | - 问一下每月请求量 1031 | - 问一下每秒请求量 (他们可能会主动提到或者让你算一下) 1032 | - 评估读写所占的百分比 1033 | - 评估的时候牢记 2/8 原则 1034 | - 每秒写多少数据 1035 | - 总的数据存储量要考虑超过 5 年的情况 1036 | - 每秒读多少数据 1037 | 3. 抽象设计: 1038 | - 分层 (服务, 数据, 缓存) 1039 | - 基础设施: 负载均衡, 消息 1040 | - 粗略的概括任何驱动整个服务的关键算法 1041 | - 考虑瓶颈并指出解决方案 1042 | - 练习: 1043 | - [设计一个 CDN 网络](http://repository.cmu.edu/cgi/viewcontent.cgi?article=2112&context=compsci) 1044 | - [设计一个随机唯一 ID 生成系统](https://blog.twitter.com/2010/announcing-snowflake) 1045 | - [设计一个在线多人卡牌游戏](http://www.indieflashblog.com/how-to-create-an-asynchronous-multiplayer-game.html) 1046 | - [设计一个 key-value 数据库](http://www.slideshare.net/dvirsky/introduction-to-redis) 1047 | - [设计一个函数获取过去某个时间段内前 K 个最高频访问的请求]( https://icmi.cs.ucsb.edu/research/tech_reports/reports/2005-23.pdf) 1048 | - [设计一个图片分享系统](http://highscalability.com/blog/2011/12/6/instagram-architecture-14-million-users-terabytes-of-photos.html) 1049 | - [设计一个推荐系统](http://ijcai13.org/files/tutorial_slides/td3.pdf) 1050 | - [设计一个短域名生成系统](http://www.hiredintech.com/system-design/the-system-design-process/) 1051 | - [设计一个缓存系统](https://www.adayinthelifeof.nl/2011/02/06/memcache-internals/) 1052 | 1053 | - ### 论文 1054 | - 有 Google 的论文和一些知名的论文. 1055 | - 你很可能实在没时间一篇篇完整的读完他们。我建议可以有选择的读其中一些论文里的核心部分。 1056 | - [ ] [1978: 通信顺序处理](http://spinroot.com/courses/summer/Papers/hoare_1978.pdf) 1057 | - [Go 实现](https://godoc.org/github.com/thomas11/csp) 1058 | - [喜欢经典的论文?](https://www.cs.cmu.edu/~crary/819-f09/) 1059 | - [ ] [2003: The Google 文件系统](http://static.googleusercontent.com/media/research.google.com/en//archive/gfs-sosp2003.pdf) 1060 | - 2012 年被 Colossus 取代了 1061 | - [ ] [2004: MapReduce: Simplified Data Processing on Large Clusters]( http://static.googleusercontent.com/media/research.google.com/en//archive/mapreduce-osdi04.pdf) 1062 | - 大多被云数据流取代了? 1063 | - [ ] [2007: 每个程序员都应该知道的内存知识 (非常长，作者建议跳过某些章节来阅读)](https://www.akkadia.org/drepper/cpumemory.pdf) 1064 | - [ ] [2012: Google 的 Colossus](https://www.wired.com/2012/07/google-colossus/) 1065 | - 没有论文 1066 | - [ ] 2012: AddressSanitizer: 快速的内存访问检查器: 1067 | - [论文](http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/37752.pdf) 1068 | - [视频](https://www.usenix.org/conference/atc12/technical-sessions/presentation/serebryany) 1069 | - [ ] 2013: Spanner: Google 的分布式数据库: 1070 | - [论文](http://static.googleusercontent.com/media/research.google.com/en//archive/spanner-osdi2012.pdf) 1071 | - [视频](https://www.usenix.org/node/170855) 1072 | - [ ] [2014: Machine Learning: The High-Interest Credit Card of Technical Debt](http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43146.pdf) 1073 | - [ ] [2015: Continuous Pipelines at Google](http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43790.pdf) 1074 | - [ ] [2015: 大规模高可用: 构建 Google Ads 的数据基础设施](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44686.pdf) 1075 | - [ ] [2015: TensorFlow: 异构分布式系统上的大规模机器学习](http://download.tensorflow.org/paper/whitepaper2015.pdf ) 1076 | - [ ] [2015: 开发者应该如何搜索代码：用例学习](http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43835.pdf) 1077 | - [ ] [2016: Borg, Omega, and Kubernetes](http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44843.pdf) 1078 | 1079 | - ### 测试 1080 | - 涵盖了: 1081 | - 单元测试是如何工作的 1082 | - 什么是模拟对象 1083 | - 什么是集成测试 1084 | - 什么是依赖注入 1085 | - [ ] [James Bach 讲敏捷软件测试 (video)](https://www.youtube.com/watch?v=SAhJf36_u5U) 1086 | - [ ] [James Bach 软件测试公开课 (video)](https://www.youtube.com/watch?v=ILkT_HV9DVU) 1087 | - [ ] [Steve Freeman - 测试驱动的开发 (video)](https://vimeo.com/83960706) 1088 | - [slides](http://gotocon.com/dl/goto-berlin-2013/slides/SteveFreeman_TestDrivenDevelopmentThatsNotWhatWeMeant.pdf) 1089 | - [ ] [测试驱动的开发已死。测试不朽。](http://david.heinemeierhansson.com/2014/tdd-is-dead-long-live-testing.html) 1090 | - [ ] [测试驱动的开发已死? (video)](https://www.youtube.com/watch?v=z9quxZsLcfo) 1091 | - [ ] [视频系列 (152 个) - 并不都是必须 (video)](https://www.youtube.com/watch?v=nzJapzxH_rE&list=PLAwxTw4SYaPkWVHeC_8aSIbSxE_NXI76g) 1092 | - [ ] [Python：测试驱动的 Web 开发](http://www.obeythetestinggoat.com/pages/book.html#toc) 1093 | - [ ] 依赖注入: 1094 | - [ ] [视频](https://www.youtube.com/watch?v=IKD2-MAkXyQ) 1095 | - [ ] [测试之道](http://jasonpolites.github.io/tao-of-testing/ch3-1.1.html) 1096 | - [ ] [如何编写测试](http://jasonpolites.github.io/tao-of-testing/ch4-1.1.html) 1097 | 1098 | - ### 调度 1099 | - 在操作系统中是如何运作的 1100 | - 在操作系统部分的视频里有很多资料 1101 | 1102 | - ### 实现系统例程 1103 | - 理解你使用的系统 API 底层有什么 1104 | - 你能自己实现它们么? 1105 | 1106 | - ### 字符串搜索和操作 1107 | - [ ] [文本的搜索模式 (video)](https://www.coursera.org/learn/data-structures/lecture/tAfHI/search-pattern-in-text) 1108 | - [ ] Rabin-Karp (videos): 1109 | - [Rabin Karps 算法](https://www.coursera.org/learn/data-structures/lecture/c0Qkw/rabin-karps-algorithm) 1110 | - [预先计算的优化](https://www.coursera.org/learn/data-structures/lecture/nYrc8/optimization-precomputation) 1111 | - [优化: 实现和分析](https://www.coursera.org/learn/data-structures/lecture/h4ZLc/optimization-implementation-and-analysis) 1112 | - [Table Doubling, Karp-Rabin](https://www.youtube.com/watch?v=BRO7mVIFt08&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=9) 1113 | - [滚动哈希](https://www.youtube.com/watch?v=w6nuXg0BISo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=32) 1114 | - [ ] Knuth-Morris-Pratt (KMP) 算法: 1115 | - [Pratt 算法](https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm) 1116 | - [教程: Knuth-Morris-Pratt (KMP) 字符串匹配算法](https://www.youtube.com/watch?v=2ogqPWJSftE) 1117 | - [ ] Boyer–Moore 字符串搜索算法 1118 | - [Boyer-Moore字符串搜索算法](https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm) 1119 | - [Boyer-Moore-Horspool 高级字符串搜索算法 (video)](https://www.youtube.com/watch?v=QDZpzctPf10) 1120 | - [ ] [Coursera: 字符串的算法](https://www.coursera.org/learn/algorithms-on-strings/home/week/1) 1121 | 1122 | --- 1123 | 1124 | ## 终面 1125 | 1126 | 这一部分有一些短视频，你可以快速的观看和复习大多数重要概念。 1127 | 这对经常性的巩固很有帮助。 1128 | 1129 | #### 综述: 1130 | 1131 | - [ ] 2-3 分钟的短视频系列 (23 个) 1132 | - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) 1133 | - [ ] 2-5 分钟的短视频系列 - Michael Sambol (18 个): 1134 | - [Videos](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ) 1135 | 1136 | #### 排序: 1137 | 1138 | - [ ] 归并排序: https://www.youtube.com/watch?v=GCae1WNvnZM 1139 | 1140 | 1141 | ## 书籍 1142 | 1143 | ### Google Coaching 里提到的 1144 | 1145 | **阅读并做练习:** 1146 | 1147 | - [ ] 算法设计手册 (Skiena) 1148 | - 书 (Kindle 上可以租到): 1149 | - [Algorithm Design Manual](http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1849967202) 1150 | - Half.com 是一个资源丰富且性价比很高的在线书店. 1151 | - 答案: 1152 | - [解答](http://www.algorithm.cs.sunysb.edu/algowiki/index.php/The_Algorithms_Design_Manual_(Second_Edition)) 1153 | - [解答](http://blog.panictank.net/category/algorithmndesignmanualsolutions/page/2/) 1154 | - [勘误表](http://www3.cs.stonybrook.edu/~skiena/algorist/book/errata) 1155 | 1156 | read and do exercises from the books below. Then move to coding challenges (further down below) 1157 | 一旦你理解了每日计划里的所有内容，就去读上面所列的书并完成练习，然后开始读下面所列的书并做练习，之后就可以开始实战写代码了（本文再往后的部分） 1158 | 1159 | **首先阅读:** 1160 | - [ ] [Programming Interviews Exposed: Secrets to Landing Your Next Job, 2nd Edition](http://www.wiley.com/WileyCDA/WileyTitle/productCd-047012167X.html) 1161 | 1162 | **然后阅读 (这本获得了很多推荐， 但是不在 Google coaching 的文档里):** 1163 | - [ ] [Cracking the Coding Interview, 6th Edition](http://www.amazon.com/Cracking-Coding-Interview-6th-Programming/dp/0984782850/) 1164 | - 如果你看到有人在看 "The Google Resume", 实际上它和 "Cracking the Coding Interview" 是同一个作者写的，而且后者是升级版。 1165 | 1166 | ### 附加书单 1167 | 1168 | 这些没有被 Google 推荐阅读，不过我因为需要这些背景知识所以也把它们列在了这里。 1169 | 1170 | - [ ] C Programming Language, Vol 2 1171 | - [练习的答案](https://github.com/lekkas/c-algorithms) 1172 | 1173 | - [ ] C++ Primer Plus, 6th Edition 1174 | 1175 | - [ ] [《Unxi 环境高级编程》 The Unix Programming Environment](http://product.half.ebay.com/The-UNIX-Programming-Environment-by-Brian-W-Kernighan-and-Rob-Pike-1983-Other/54385&tg=info) 1176 | 1177 | - [ ] [《编程珠玑》 Programming Pearls](http://www.amazon.com/Programming-Pearls-2nd-Jon-Bentley/dp/0201657880) 1178 | 1179 | - [ ] [Algorithms and Programming: Problems and Solutions](http://www.amazon.com/Algorithms-Programming-Solutions-Alexander-Shen/dp/0817638474) 1180 | 1181 | ### 如果你有时间 1182 | 1183 | - [ ] [Introduction to Algorithms](https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844) 1184 | 1185 | - [ ] [Elements of Programming Interviews](https://www.amazon.com/Elements-Programming-Interviews-Insiders-Guide/dp/1479274836) 1186 | - 如果你希望在面试里用 C++ 写代码，这本书的代码全都是 C++ 写的 1187 | - 通常情况下能找到解决方案的好书. 1188 | 1189 | ## 编码练习和挑战 1190 | 1191 | 一旦你学会了理论基础，就应该把它们拿出来练练。 1192 | 尽量坚持每天做编码练习，越多越好。 1193 | 1194 | 编程问题预备: 1195 | 1196 | - [ ] [不错的介绍 (摘自 System Design 章节): 算法设计:](http://www.hiredintech.com/algorithm-design/) 1197 | - [ ] [如何找到解决方案](https://www.topcoder.com/community/data-science/data-science-tutorials/how-to-find-a-solution/) 1198 | - [ ] [如何剖析 Topcoder 题目描述](https://www.topcoder.com/community/data-science/data-science-tutorials/how-to-dissect-a-topcoder-problem-statement/) 1199 | - [ ] [Topcoders 里用到的数学](https://www.topcoder.com/community/data-science/data-science-tutorials/mathematics-for-topcoders/) 1200 | - [ ] [动态规划 – 从入门到精通](https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/) 1201 | 1202 | - [MIT 面试材料](https://courses.csail.mit.edu/iap/interview/materials.php) 1203 | 1204 | - [针对编程语言本身的练习](http://exercism.io/languages) 1205 | 1206 | 编码练习平台: 1207 | 1208 | - [LeetCode](https://leetcode.com/) 1209 | - [TopCoder](https://www.topcoder.com/) 1210 | - [Project Euler (数学方向为主)](https://projecteuler.net/index.php?section=problems) 1211 | - [Codewars](http://www.codewars.com) 1212 | - [HackerRank](https://www.hackerrank.com/) 1213 | - [Codility](https://codility.com/programmers/) 1214 | - [InterviewCake](https://www.interviewcake.com/) 1215 | - [InterviewBit](https://www.interviewbit.com/invite/icjf) 1216 | 1217 | - [模拟大公司的面试](http://www.gainlo.co/) 1218 | 1219 | ## 当你临近面试时 1220 | 1221 | - [ ] 搞定代码面试 (videos): 1222 | - [Cracking The Code Interview](https://www.youtube.com/watch?v=4NIb9l3imAo) 1223 | - [Cracking the Coding Interview - 全栈系列](https://www.youtube.com/watch?v=Eg5-tdAwclo) 1224 | - [Ask Me Anything: Gayle Laakmann McDowell (Cracking the Coding Interview 的作者)](https://www.youtube.com/watch?v=1fqxMuPmGak) 1225 | 1226 | ## 你的简历 1227 | 1228 | - [10 条小贴士让你写出一份还算不错的简历](http://steve-yegge.blogspot.co.uk/2007_09_01_archive.html) 1229 | - 这是搞定面试的第一个关键步骤 1230 | 1231 | 1232 | ## 当面试来临的时候 1233 | 1234 | 随着下面列举的问题思考下你可能会遇到的 20 个面试问题 1235 | 每个问题准备 2-3 种回答 1236 | 准备点故事，不要只是摆一些你完成的事情的数据，相信我，人人都喜欢听故事 1237 | 1238 | - 你为什么想得到这份工作？ 1239 | - 你解决过的最有难度的问题是什么？ 1240 | - 面对过的最大挑战是什么? 1241 | - 见过的最好或者最坏的设计是怎么样的? 1242 | - 对某项 Google 产品提出改进建议。 1243 | - 你作为一个个体同时也是团队的一员，如何达到最好的工作状态? 1244 | - 你的什么技能或者经验是你的角色中不可或缺的?为什么？ 1245 | - 你在某份工作或某个项目中最享受的是什么? 1246 | - 你在某份工作或某个项目中面临过的最大挑战是什么? 1247 | - 你在某份工作或某个项目中遇到过的最蛋疼的 Bug 是什么样的？ 1248 | - 你在某份工作或某个项目中学到了什么？ 1249 | - 你在某份工作或某个项目中哪些地方还可以做的更好？ 1250 | 1251 | ## 问面试官的问题 1252 | 1253 | 我会问的一些：(可能我已经知道了答案但我想听听面试官的看法或者了解团队的前景): 1254 | 1255 | - 团队多大规模? 1256 | - 开发周期是怎样的? 会使用瀑布流/极限编程/敏捷开发么? 1257 | - 经常会为 deadline 加班么? 或者是有弹性的? 1258 | - 团队里怎么做技术选型? 1259 | - 每周平均开多少次会? 1260 | - 你觉得工作环境有助于员工集中精力吗? 1261 | - 目前正在做什么工作? 1262 | - 喜欢这些事情吗? 1263 | - 工作期限是怎么样的? 1264 | 1265 | ## 当你获得了梦想的职位 1266 | 1267 | 我还能说些什么呢，恭喜你！ 1268 | 1269 | - [我希望在 Google 的第一天就知道的 10 件事](https://medium.com/@moonstorming/10-things-i-wish-i-knew-on-my-first-day-at-google-107581d87286#.livxn7clw) 1270 | 1271 | 坚持继续学习。 1272 | 1273 | 得到这份工作只是一个开始。 1274 | 1275 | --- 1276 | 1277 | ***************************************************************************************************** 1278 | ***************************************************************************************************** 1279 | 1280 | 下面的内容都是可选的。这些是我的推荐，不是 Google 的。 1281 | 通过学习这些内容，你将会得到更多的有关 CS 的概念，并将为所有的软件工程工作做更好的准备。 1282 | 1283 | ***************************************************************************************************** 1284 | ***************************************************************************************************** 1285 | 1286 | --- 1287 | 1288 | ## 附加的学习 1289 | 1290 | - ### Unicode 1291 | - [ ] [每一个软件开发者的绝对最低限度，必须要知道的关于 Unicode 和字符集知识]( http://www.joelonsoftware.com/articles/Unicode.html) 1292 | - [ ] [关于处理文本需要的编码和字符集, 每个程序员绝对需要知道的知识](http://kunststube.net/encoding/) 1293 | 1294 | - ### 字节顺序 1295 | - [ ] [大、小端字节序](https://www.cs.umd.edu/class/sum2003/cmsc311/Notes/Data/endian.html) 1296 | - [ ] [大端字节 Vs 小端字节(视频)](https://www.youtube.com/watch?v=JrNF0KRAlyo) 1297 | - [ ] [大、小端字节序的里里外外(Big And Little Endian Inside/Out) (视频)](https://www.youtube.com/watch?v=oBSuXP-1Tc0) 1298 | - 内核开发者的讨论非常技术性，如果大多数都超出了你的理解范围，不要太担心。 1299 | - 前半段已经足够了。 1300 | 1301 | - ### Emacs and vi(m) 1302 | - Yegge 的建议，从一个很早以前的亚马逊招聘信息中而来：熟悉基于 unix 的代码编辑器 1303 | - vi(m): 1304 | - [使用 vim 进行编辑 01 - 安装, 设置和模式 (视频)](https://www.youtube.com/watch?v=5givLEMcINQ&index=1&list=PL13bz4SHGmRxlZVmWQ9DvXo1fEg4UdGkr) 1305 | - [VIM 的冒险之旅](http://vim-adventures.com/) 1306 | - 4 个视频集: 1307 | - [vi/vim 编辑器 - 课程 1](https://www.youtube.com/watch?v=SI8TeVMX8pk) 1308 | - [vi/vim 编辑器 - 课程 2](https://www.youtube.com/watch?v=F3OO7ZIOaJE) 1309 | - [vi/vim 编辑器 - 课程 4](https://www.youtube.com/watch?v=1lYD5gwgZIA) 1310 | - [vi/vim 编辑器 - 课程 3](https://www.youtube.com/watch?v=ZYEccA_nMaI) 1311 | - [使用 Vi 而不是 Emacs](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Using_Vi_instead_of_Emacs) 1312 | - emacs: 1313 | - [基础 Emacs 教程 (视频)](https://www.youtube.com/watch?v=hbmV1bnQ-i0) 1314 | - 3 个视频集: 1315 | - [Emacs 教程 (初学者) -第 1 部分- 文件命令, 剪切/复制/粘贴, 自定义命令](https://www.youtube.com/watch?v=ujODL7MD04Q) 1316 | - [Emacs 教程 (初学者 -第 2 部分- Buffer 管理, 搜索, M-x grep 和 rgrep 模式](https://www.youtube.com/watch?v=XWpsRupJ4II) 1317 | - [Emacs 教程 (初学者 -第 3 部分- 表达式, 声明, ~/.emacs 文件和包机制](https://www.youtube.com/watch?v=paSgzPso-yc) 1318 | - [Evil 模式: 或许, 我是怎样对 Emacs 路人转粉的 (视频)](https://www.youtube.com/watch?v=JWD1Fpdd4Pc) 1319 | - [使用 Emacs 开发 C 程序](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs) 1320 | - [(或许) 深度组织模式:管理结构 (视频)](https://www.youtube.com/watch?v=nsGYet02bEk) 1321 | 1322 | - ### Unix 命令行工具 1323 | - 下列内容中的优秀工具由的 Yegge 推荐，Yegge 目前致力于 Amazon 人事招聘处。 1324 | - [ ] bash 1325 | - [ ] cat 1326 | - [ ] grep 1327 | - [ ] sed 1328 | - [ ] awk 1329 | - [ ] curl or wget 1330 | - [ ] sort 1331 | - [ ] tr 1332 | - [ ] uniq 1333 | - [ ] [strace](https://en.wikipedia.org/wiki/Strace) 1334 | - [ ] [tcpdump](https://danielmiessler.com/study/tcpdump/) 1335 | 1336 | - ### 信息资源 (视频) 1337 | - [ ] [Khan Academy 可汗学院](https://www.khanacademy.org/computing/computer-science/informationtheory) 1338 | - [ ] 更多有关马尔可夫的内容: 1339 | - [ ] [Core Markov Text Generation马尔可夫内容生成](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/waxgx/core-markov-text-generation) 1340 | - [ ] [Core Implementing Markov Text Generation马尔可夫内容生成补充](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/gZhiC/core-implementing-markov-text-generation) 1341 | - [ ] [Project = Markov Text Generation Walk Through一个马尔可夫内容生成器的项目](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/EUjrq/project-markov-text-generation-walk-through) 1342 | - 关于更多信息，请参照下方 MIT 6.050J 信息和系统复杂度的内容. 1343 | 1344 | - ### 奇偶校验位 & 汉明码 (视频) 1345 | - [ ] [入门](https://www.youtube.com/watch?v=q-3BctoUpHE) 1346 | - [ ] [奇偶校验位](https://www.youtube.com/watch?v=DdMcAUlxh1M) 1347 | - [ ] 汉明码(Hamming Code): 1348 | - [发现错误](https://www.youtube.com/watch?v=1A_NcXxdoCc) 1349 | - [修正错误](https://www.youtube.com/watch?v=JAMLuxdHH8o) 1350 | - [ ] [检查错误](https://www.youtube.com/watch?v=wbH2VxzmoZk) 1351 | 1352 | - ### 系统熵值（系统复杂度） 1353 | - 请参考下方视频 1354 | - 观看之前，请先确定观看了信息论的视频 1355 | - [ ] [信息理论, 克劳德·香农, 熵值, 系统冗余, 数据比特压缩 (视频)](https://youtu.be/JnJq3Py0dyM?t=176) 1356 | 1357 | - ### 密码学 1358 | - 请参考下方视频 1359 | - 观看之前，请先确定观看了信息论的视频 1360 | - [ ] [可汗学院](https://www.khanacademy.org/computing/computer-science/密码学) 1361 | - [ ] [密码学: 哈希函数](https://www.youtube.com/watch?v=KqqOXndnvic&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=30) 1362 | - [ ] [密码学: 加密](https://www.youtube.com/watch?v=9TNI2wHmaeI&index=31&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) 1363 | 1364 | - ### 压缩 1365 | - 观看之前，请先确定观看了信息论的视频 1366 | - [ ] 压缩 (视频): 1367 | - [ ] [压缩](https://www.youtube.com/watch?v=Lto-ajuqW3w) 1368 | - [ ] [压缩熵值](https://www.youtube.com/watch?v=M5c_RFKVkko) 1369 | - [ ] [由上而下的树 (霍夫曼编码树)](https://www.youtube.com/watch?v=umTbivyJoiI) 1370 | - [ ] [额外比特 - 霍夫曼编码树](https://www.youtube.com/watch?v=DV8efuB3h2g) 1371 | - [ ] [优雅的压缩数据 (无损数据压缩方法)](https://www.youtube.com/watch?v=goOa3DGezUA) 1372 | - [ ] [Text Compression Meets Probabilities](https://www.youtube.com/watch?v=cCDCfoHTsaU) 1373 | - [ ] [数据压缩的艺术](https://www.youtube.com/playlist?list=PLOU2XLYxmsIJGErt5rrCqaSGTMyyqNt2H) 1374 | - [ ] [(可选) 谷歌开发者: GZIP 还差远了呢!](https://www.youtube.com/watch?v=whGwm0Lky2s) 1375 | 1376 | - ### 网络 (视频) 1377 | - [ ] [可汗学院](https://www.khanacademy.org/computing/computer-science/internet-intro) 1378 | - [ ] [网络传输协议中的数据压缩](https://www.youtube.com/watch?v=Vdc8TCESIg8) 1379 | - [ ] [TCP/IP 和 OSI 模型解析!](https://www.youtube.com/watch?v=e5DEVa9eSN0) 1380 | - [ ] [TCP/IP 教程：传输数据包.](https://www.youtube.com/watch?v=nomyRJehhnM) 1381 | - [ ] [HTTP](https://www.youtube.com/watch?v=WGJrLqtX7As) 1382 | - [ ] [SSL 和 HTTPS](https://www.youtube.com/watch?v=S2iBR2ZlZf0) 1383 | - [ ] [SSL/TLS](https://www.youtube.com/watch?v=Rp3iZUvXWlM) 1384 | - [ ] [HTTP 2.0](https://www.youtube.com/watch?v=E9FxNzv1Tr8) 1385 | - [ ] [视频](https://www.youtube.com/playlist?list=PLEbnTDJUr_IegfoqO4iPnPYQui46QqT0j) 1386 | - [ ] [子网络解密 - 第五部分 经典内部域名指向 CIDR 标记](https://www.youtube.com/watch?v=t5xYI0jzOf4) 1387 | 1388 | - ### 计算机安全 1389 | - [MIT](https://www.youtube.com/playlist?list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1390 | - [ ] [威胁模型：入门](https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1391 | - [ ] [控制攻击](https://www.youtube.com/watch?v=6bwzNg5qQ0o&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=2) 1392 | - [ ] [缓冲数据注入和防御](https://www.youtube.com/watch?v=drQyrzRoRiA&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=3) 1393 | - [ ] [优先权区分](https://www.youtube.com/watch?v=6SIJmoE9L9g&index=4&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1394 | - [ ] [能力](https://www.youtube.com/watch?v=8VqTSY-11F4&index=5&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1395 | - [ ] [在沙盒中运行原生代码](https://www.youtube.com/watch?v=VEV74hwASeU&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=6) 1396 | - [ ] [网络安全模型](https://www.youtube.com/watch?v=chkFBigodIw&index=7&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1397 | - [ ] [网络安全应用](https://www.youtube.com/watch?v=EBQIGy1ROLY&index=8&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1398 | - [ ] [标志化执行](https://www.youtube.com/watch?v=yRVZPvHYHzw&index=9&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1399 | - [ ] [网络安全](https://www.youtube.com/watch?v=SIEVvk3NVuk&index=11&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1400 | - [ ] [网络协议](https://www.youtube.com/watch?v=QOtA76ga_fY&index=12&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1401 | - [ ] [旁路攻击](https://www.youtube.com/watch?v=PuVMkSEcPiI&index=15&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1402 | 1403 | - ### 释放缓存 1404 | - [ ] [Java 释放缓存; 片段化数据 (视频)](https://www.youtube.com/watch?v=StdfeXaKGEc&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=25) 1405 | - [ ] [编译器 (视频)](https://www.youtube.com/playlist?list=PLO9y7hOkmmSGTy5z6HZ-W4k2y8WXF7Bff) 1406 | - [ ] [Python 释放缓存 (视频)](https://www.youtube.com/watch?v=iHVs_HkjdmI) 1407 | - [ ] [深度解析：论释放缓存在 JAVA 中的重要性](https://www.infoq.com/presentations/garbage-collection-benefits) 1408 | - [ ] [深度解析：论释放缓存在 Python 中的重要性(视频)](https://www.youtube.com/watch?v=P-8Z0-MhdQs&list=PLdzf4Clw0VbOEWOS_sLhT_9zaiQDrS5AR&index=3) 1409 | 1410 | - ### 并行/并发编程 1411 | - [ ] [Coursera (Scala)](https://www.coursera.org/learn/parprog1/home/week/1) 1412 | - [ ] [论并行/并发编程如何提高 Python 执行效率 (视频)](https://www.youtube.com/watch?v=uY85GkaYzBk) 1413 | 1414 | - ### 设计模式 1415 | - [ ] [UML统一建模语言概览 (视频)](https://www.youtube.com/watch?v=3cmzqZzwNDM&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc&index=3) 1416 | - [ ] 主要有如下的设计模式: 1417 | - [ ] s(strategy) 1418 | - [ ] singleton 1419 | - [ ] adapter 1420 | - [ ] prototype 1421 | - [ ] decorator 1422 | - [ ] visitor 1423 | - [ ] factory, abstract factory 1424 | - [ ] facade 1425 | - [ ] observer 1426 | - [ ] proxy 1427 | - [ ] delegate 1428 | - [ ] command 1429 | - [ ] state 1430 | - [ ] memento 1431 | - [ ] iterator 1432 | - [ ] composite 1433 | - [ ] flyweight 1434 | - [ ] [第六章 (第 1 部分 ) - 设计模式 (视频)](https://youtu.be/LAP2A80Ajrg?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO&t=3344) 1435 | - [ ] [第六章 (第 2 部分 ) - Abstraction-Occurrence, General Hierarchy, Player-Role, Singleton, Observer, Delegation (视频)](https://www.youtube.com/watch?v=U8-PGsjvZc4&index=12&list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO) 1436 | - [ ] [第六章 (第 3 部分 ) - Adapter, Facade, Immutable, Read-Only Interface, Proxy (video)](https://www.youtube.com/watch?v=7sduBHuex4c&index=13&list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO) 1437 | - [ ] [视频](https://www.youtube.com/playlist?list=PLF206E906175C7E07) 1438 | - [ ] [Head Fisrt 设计模型](https://www.amazon.com/Head-First-Design-Patterns-Freeman/dp/0596007124) 1439 | - 尽管这本书叫做设计模式：重复使用模块，但是我还是认为Head First是对于新手来说很不错的书。 1440 | - [ ] [基于实际操作对于入门开发者的建议](https://sourcemaking.com/design-patterns-and-tips) 1441 | 1442 | - ### 信息传输, 序列化,和队列化的系统 1443 | - [ ] [Thrift](https://thrift.apache.org/) 1444 | - [教程](http://thrift-tutorial.readthedocs.io/en/latest/intro.html) 1445 | - [ ] [协议缓冲](https://developers.google.com/protocol-buffers/) 1446 | - [教程](https://developers.google.com/protocol-buffers/docs/tutorials) 1447 | - [ ] [gRPC](http://www.grpc.io/) 1448 | - [gRPC 对于JAVA开发者的入门教程（视频）](https://www.youtube.com/watch?v=5tmPvSe7xXQ&list=PLcTqM9n_dieN0k1nSeN36Z_ppKnvMJoly&index=1) 1449 | - [ ] [Redis](http://redis.io/) 1450 | - [教程](http://try.redis.io/) 1451 | - [ ] [Amazon的 SQS 系统 (队列)](https://aws.amazon.com/sqs/) 1452 | - [ ] [Amazon的 SNS 系统 (pub-sub)](https://aws.amazon.com/sns/) 1453 | - [ ] [RabbitMQ](https://www.rabbitmq.com/) 1454 | - [入门教程](https://www.rabbitmq.com/getstarted.html) 1455 | - [ ] [Celery](http://www.celeryproject.org/) 1456 | - [Celery入门](http://docs.celeryproject.org/en/latest/getting-started/first-steps-with-celery.html) 1457 | - [ ] [ZeroMQ](http://zeromq.org/) 1458 | - [入门教程](http://zeromq.org/intro:read-the-manual) 1459 | - [ ] [ActiveMQ](http://activemq.apache.org/) 1460 | - [ ] [Kafka](http://kafka.apache.org/documentation.html#introduction) 1461 | - [ ] [MessagePack](http://msgpack.org/index.html) 1462 | - [ ] [Avro](https://avro.apache.org/) 1463 | 1464 | - ### 快速傅里叶变换 1465 | - [ ] [什么是傅立叶变换？论傅立叶变换的用途](http://www.askamathematician.com/2012/09/q-what-is-a-fourier-transform-what-is-it-used-for/) 1466 | - [ ] [什么是傅立叶变换？ (视频)](https://www.youtube.com/watch?v=Xxut2PN-V8Q) 1467 | - [ ] [关于 FFT 的不同观点 (视频)](https://www.youtube.com/watch?v=iTMn0Kt18tg&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=4) 1468 | - [ ] [FTT 是什么](http://jakevdp.github.io/blog/2013/08/28/understanding-the-fft/) 1469 | 1470 | - ### 布隆过滤器 1471 | - 给一个布隆过滤器m比特和k个哈希函数，所有的注入和相关测试都会是通过。 1472 | - [布隆过滤器](https://www.youtube.com/watch?v=-SuTGoFYjZs) 1473 | - [布隆过滤器 | 数据挖掘 | Stanford University](https://www.youtube.com/watch?v=qBTdukbzc78) 1474 | - [教程](http://billmill.org/bloomfilter-tutorial/) 1475 | - [如何写一个布隆过滤器应用](http://blog.michaelschmatz.com/2016/04/11/how-to-write-a-bloom-filter-cpp/) 1476 | 1477 | - ### van Emde Boas 树 1478 | - [ ] [争论: van Emde Boas 树 (视频)](https://www.youtube.com/watch?v=hmReJCupbNU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=6) 1479 | - [ ] [MIT课堂笔记](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2012/lecture-notes/MIT6_046JS12_lec15.pdf) 1480 | 1481 | - ### 更深入的数据结构 1482 | - [ ] [CS 61B 第 39 课: 更深入的数据结构](https://youtu.be/zksIj9O8_jc?list=PL4BBB74C7D2A1049C&t=950) 1483 | 1484 | - ### 跳表 1485 | - "有一种非常迷幻的数据类型" - Skiena 1486 | - [ ] [随机化: 跳表 (视频)](https://www.youtube.com/watch?v=2g9OSRKJuzM&index=10&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) 1487 | - [ ] [更生动详细的解释](https://en.wikipedia.org/wiki/Skip_list) 1488 | 1489 | - ### 网络流 1490 | - [ ] [5分钟简析Ford-Fulkerson (视频)](https://www.youtube.com/watch?v=v1VgJmkEJW0) 1491 | - [ ] [Ford-Fulkerson 算法 (视频)](https://www.youtube.com/watch?v=v1VgJmkEJW0) 1492 | - [ ] [网络流 (视频)](https://www.youtube.com/watch?v=2vhN4Ice5jI) 1493 | 1494 | - ### 不相交集 & 联合查找 1495 | - [ ] [不相交集](https://en.wikipedia.org/wiki/Disjoint-set_data_structure) 1496 | - [ ] [UCB 61B - 不相交集; 排序 & 选择(视频)](https://www.youtube.com/watch?v=MAEGXTwmUsI&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd&index=21) 1497 | - [ ] Coursera (not needed since the above video explains it great): 1498 | - [ ] [概览](https://www.coursera.org/learn/data-structures/lecture/JssSY/overview) 1499 | - [ ] [初级实践](https://www.coursera.org/learn/data-structures/lecture/EM5D0/naive-implementations) 1500 | - [ ] [树状结构](https://www.coursera.org/learn/data-structures/lecture/Mxu0w/trees) 1501 | - [ ] [合并树状结构](https://www.coursera.org/learn/data-structures/lecture/qb4c2/union-by-rank) 1502 | - [ ] [路径压缩](https://www.coursera.org/learn/data-structures/lecture/Q9CVI/path-compression) 1503 | - [ ] [分析选项](https://www.coursera.org/learn/data-structures/lecture/GQQLN/analysis-optional) 1504 | 1505 | - ### 快速处理数学 1506 | - [ ] [整数运算, Karatsuba 乘法 (视频)](https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) 1507 | - [ ] [中国剩余定理 (在密码学中的使用) (视频)](https://www.youtube.com/watch?v=ru7mWZJlRQg) 1508 | 1509 | - ### 树堆 (Treap) 1510 | - 一个二叉搜索树和一个堆的组合 1511 | - [ ] [树堆](https://en.wikipedia.org/wiki/Treap) 1512 | - [ ] [数据结构：树堆的讲解(video)](https://www.youtube.com/watch?v=6podLUYinH8) 1513 | - [ ] [集合操作的应用(Applications in set operations)](https://www.cs.cmu.edu/~scandal/papers/treaps-spaa98.pdf) 1514 | 1515 | - ### 线性规划（Linear Programming）（视频） 1516 | - [ ] [线性规划](https://www.youtube.com/watch?v=M4K6HYLHREQ) 1517 | - [ ] [寻找最小成本](https://www.youtube.com/watch?v=2ACJ9ewUC6U) 1518 | - [ ] [寻找最大值](https://www.youtube.com/watch?v=8AA_81xI3ik) 1519 | 1520 | - ### 几何：凸包（Geometry, Convex hull）（视频） 1521 | - [ ] [Graph Alg. IV: 几何算法介绍 - 第 9 课](https://youtu.be/XIAQRlNkJAw?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3164) 1522 | - [ ] [Graham & Jarvis: 几何算法 - 第 10 课](https://www.youtube.com/watch?v=J5aJEcOr6Eo&index=10&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm) 1523 | - [ ] [Divide & Conquer: 凸包, 中值查找](https://www.youtube.com/watch?v=EzeYI7p9MjU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=2) 1524 | 1525 | - ### 离散数学 1526 | - 查看下面的视频：(这里没看到视频= =） 1527 | 1528 | - ### 机器学习（Machine Learning） 1529 | - [ ] 为什么学习机器学习？ 1530 | - [ ] [谷歌如何将自己改造成一家「机器学习优先」公司？](https://backchannel.com/how-google-is-remaking-itself-as-a-machine-learning-first-company-ada63defcb70) 1531 | - [ ] [智能计算机系统的大规模深度学习 (视频)](https://www.youtube.com/watch?v=QSaZGT4-6EY) 1532 | - [ ] [Peter Norvig：深度学习和理解与软件工程和验证的对比](https://www.youtube.com/watch?v=X769cyzBNVw) 1533 | - [ ] [谷歌云机器学习工具（视频）](https://www.youtube.com/watch?v=Ja2hxBAwG_0) 1534 | - [ ] [谷歌开发者机器学习清单 (Scikit Learn 和 Tensorflow) (视频)](https://www.youtube.com/playlist?list=PLOU2XLYxmsIIuiBfYad6rFYQU_jL2ryal) 1535 | - [ ] [Tensorflow (视频)](https://www.youtube.com/watch?v=oZikw5k_2FM) 1536 | - [ ] [Tensorflow 教程](https://www.tensorflow.org/versions/r0.11/tutorials/index.html) 1537 | - [ ] [Python 实现神经网络实例教程（使用 Theano）](http://www.analyticsvidhya.com/blog/2016/04/neural-networks-python-theano/) 1538 | - 课程: 1539 | - [ ] [很棒的初级课程：机器学习](https://www.coursera.org/learn/machine-learning) 1540 | - [视频教程](https://www.youtube.com/playlist?list=PLZ9qNFMHZ-A4rycgrgOYma6zxF4BZGGPW) 1541 | - 看第 12-18 集复习线性代数（第 14 集和第 15 集是重复的） 1542 | - [ ] [机器学习中的神经网络](https://www.coursera.org/learn/neural-networks) 1543 | - [ ] [Google 深度学习微学位](https://www.udacity.com/course/deep-learning--ud730) 1544 | - [ ] [Google/Kaggle 机器学习工程师微学位](https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009) 1545 | - [ ] [无人驾驶工程师微学位](https://www.udacity.com/drive) 1546 | - [ ] [Metis 在线课程 (两个月 99 美元)](http://www.thisismetis.com/explore-data-science) 1547 | - 资源: 1548 | - 书籍: Data Science from Scratch: First Principles with Python: https://www.amazon.com/Data-Science-Scratch-Principles-Python/dp/149190142X 1549 | - 网站: Data School: http://www.dataschool.io/ 1550 | 1551 | - ### Go 语言 1552 | - [ ] 视频: 1553 | - [ ] [为什么学习 Go 语言？](https://www.youtube.com/watch?v=FTl0tl9BGdc) 1554 | - [ ] [Go 语言编程](https://www.youtube.com/watch?v=CF9S4QZuV30) 1555 | - [ ] [Go 语言之旅](https://www.youtube.com/watch?v=ytEkHepK08c) 1556 | - [ ] 书籍: 1557 | - [ ] [Go 语言编程入门 (免费在线阅读)](https://www.golang-book.com/books/intro) 1558 | - [ ] [Go 语言圣经 (Donovan & Kernighan)](https://www.amazon.com/Programming-Language-Addison-Wesley-Professional-Computing/dp/0134190440) 1559 | - [ ] [Go 语言新手训练营](https://www.golang-book.com/guides/bootcamp) 1560 | 1561 | -- 1562 | 1563 | ## 一些主题的额外内容 1564 | 1565 | 我为前面提到的某些主题增加了一些额外的内容，之所以没有直接添加到前面，是因为这样很容易导致某个主题内容过多。毕竟你想在本世纪找到一份工作，对吧？ 1566 | 1567 | - [ ] **动态规划的更多内容** (视频) 1568 | - [ ] [6.006: 动态规划 I: 斐波那契数列, 最短路径](https://www.youtube.com/watch?v=OQ5jsbhAv_M&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=19) 1569 | - [ ] [6.006: 动态规划 II: 文本匹配, 二十一点/黑杰克](https://www.youtube.com/watch?v=ENyox7kNKeY&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=20) 1570 | - [ ] [6.006: 动态规划 III: 最优加括号方式, 最小编辑距离, 背包问题](https://www.youtube.com/watch?v=ocZMDMZwhCY&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=21) 1571 | - [ ] [6.006: 动态规划 IV: 吉他指法，拓扑，超级马里奥.](https://www.youtube.com/watch?v=tp4_UXaVyx8&index=22&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) 1572 | - [ ] [6.046: 动态规划: 动态规划进阶](https://www.youtube.com/watch?v=Tw1k46ywN6E&index=14&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) 1573 | - [ ] [6.046: 动态规划: 所有点对最短路径](https://www.youtube.com/watch?v=NzgFUwOaoIw&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=15) 1574 | - [ ] [6.046: 动态规划: 更多示例](https://www.youtube.com/watch?v=krZI60lKPek&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=12) 1575 | 1576 | - [ ] **图形处理进阶** (视频) 1577 | - [ ] [异步分布式算法: 对称性破缺，最小生成树](https://www.youtube.com/watch?v=mUBmcbbJNf4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=27) 1578 | - [ ] [异步分布式算法: 最小生成树](https://www.youtube.com/watch?v=kQ-UQAzcnzA&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=28) 1579 | 1580 | - [ ] MIT **概率论** (mathy, and go slowly, which is good for mathy things) (视频): 1581 | - [ ] [MIT 6.042J - 概率论概述](https://www.youtube.com/watch?v=SmFwFdESMHI&index=18&list=PLB7540DEDD482705B) 1582 | - [ ] [MIT 6.042J - 条件概率 Probability](https://www.youtube.com/watch?v=E6FbvM-FGZ8&index=19&list=PLB7540DEDD482705B) 1583 | - [ ] [MIT 6.042J - 独立](https://www.youtube.com/watch?v=l1BCv3qqW4A&index=20&list=PLB7540DEDD482705B) 1584 | - [ ] [MIT 6.042J - 随机变量](https://www.youtube.com/watch?v=MOfhhFaQdjw&list=PLB7540DEDD482705B&index=21) 1585 | - [ ] [MIT 6.042J - 期望 I](https://www.youtube.com/watch?v=gGlMSe7uEkA&index=22&list=PLB7540DEDD482705B) 1586 | - [ ] [MIT 6.042J - 期望 II](https://www.youtube.com/watch?v=oI9fMUqgfxY&index=23&list=PLB7540DEDD482705B) 1587 | - [ ] [MIT 6.042J - 大偏差](https://www.youtube.com/watch?v=q4mwO2qS2z4&index=24&list=PLB7540DEDD482705B) 1588 | - [ ] [MIT 6.042J - 随机游走](https://www.youtube.com/watch?v=56iFMY8QW2k&list=PLB7540DEDD482705B&index=25) 1589 | 1590 | - [ ] [Simonson: 近似算法 (视频)](https://www.youtube.com/watch?v=oDniZCmNmNw&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=19) 1591 | 1592 | ## 视频系列 1593 | 1594 | 坐下来享受一下吧。"netflix and skill" :P 1595 | 1596 | - [ ] [个人的动态规划问题列表 (都是短视频哟)](https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr) 1597 | 1598 | - [ ] [x86 架构，汇编，应用程序 (11 个视频)](https://www.youtube.com/playlist?list=PL038BE01D3BAEFDB0) 1599 | 1600 | - [ ] [MIT 18.06 线性代数，2005 年春季 (35 个视频)](https://www.youtube.com/playlist?list=PLE7DDD91010BC51F8) 1601 | 1602 | - [ ] [绝妙的 MIT 微积分：单变量微积分](https://www.youtube.com/playlist?list=PL3B08AE665AB9002A) 1603 | 1604 | - [ ] [计算机科学 70, 001 - 2015 年春季 - 离散数学和概率理论](https://www.youtube.com/playlist?list=PL-XXv-cvA_iD8wQm8U0gG_Z1uHjImKXFy) 1605 | 1606 | - [ ] [离散数学 (19 个视频)](https://www.youtube.com/playlist?list=PL3o9D4Dl2FJ9q0_gtFXPh_H4POI5dK0yG) 1607 | 1608 | - [ ] CSE373 - 算法分析 (25 个视频) 1609 | - [Skiena 的算法设计手册讲座](https://www.youtube.com/watch?v=ZFjhkohHdAA&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=1) 1610 | 1611 | - [ ] [UC Berkeley 61B (2014 年春季): 数据结构 (25 个视频)](https://www.youtube.com/watch?v=mFPmKGIrQs4&list=PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd) 1612 | 1613 | - [ ] [UC Berkeley 61B (2006 年秋季): 数据结构 (39 个视频)]( https://www.youtube.com/playlist?list=PL4BBB74C7D2A1049C) 1614 | 1615 | - [ ] [UC Berkeley 61C: 计算机结构 (26 个视频)](https://www.youtube.com/watch?v=gJJeUFyuvvg&list=PL-XXv-cvA_iCl2-D-FS5mk0jFF6cYSJs_) 1616 | 1617 | - [ ] [OOSE: 使用 UML 和 Java 进行软件开发 (21 个视频)](https://www.youtube.com/playlist?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO) 1618 | 1619 | - [ ] [UC Berkeley CS 152: 计算机结构和工程 (20 个视频)](https://www.youtube.com/watch?v=UH0QYvtP7Rk&index=20&list=PLkFD6_40KJIwEiwQx1dACXwh-2Fuo32qr) 1620 | 1621 | - [ ] [MIT 6.004: 计算结构 (49 视频)](https://www.youtube.com/playlist?list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-) 1622 | 1623 | - [ ] [卡內基梅隆大学 - 计算机架构讲座 (39 个视频)](https://www.youtube.com/playlist?list=PL5PHm2jkkXmi5CxxI7b3JCL1TWybTDtKq) 1624 | 1625 | - [ ] [MIT 6.006: 算法介绍 (47 个视频)](https://www.youtube.com/watch?v=HtSuA80QTyo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&nohtml5=False) 1626 | 1627 | - [ ] [MIT 6.033: 计算机系统工程 (22 个视频)](https://www.youtube.com/watch?v=zm2VP0kHl1M&list=PL6535748F59DCA484) 1628 | 1629 | - [ ] [MIT 6.034 人工智能, 2010 年秋季 (30 个视频)](https://www.youtube.com/playlist?list=PLUl4u3cNGP63gFHB6xb-kVBiQHYe_4hSi) 1630 | 1631 | - [ ] [MIT 6.042J: 计算机科学数学, 2010 年秋季 (25 个视频)](https://www.youtube.com/watch?v=L3LMbpZIKhQ&list=PLB7540DEDD482705B) 1632 | 1633 | - [ ] [MIT 6.046: 算法设计与分析 (34 个视频)](https://www.youtube.com/watch?v=2P-yW7LQr08&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) 1634 | 1635 | - [ ] [MIT 6.050J: 信息和熵, 2008 年春季 (19 个视频)](https://www.youtube.com/watch?v=phxsQrZQupo&list=PL_2Bwul6T-A7OldmhGODImZL8KEVE38X7) 1636 | 1637 | - [ ] [MIT 6.851: 高等数据结构 (22 个视频)](https://www.youtube.com/watch?v=T0yzrZL1py0&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=1) 1638 | 1639 | - [ ] [MIT 6.854: 高等算法, 2016 年春季 (24 个视频)](https://www.youtube.com/playlist?list=PL6ogFv-ieghdoGKGg2Bik3Gl1glBTEu8c) 1640 | 1641 | - [ ] [MIT 6.858计算机系统安全, 2014 年秋季](https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh) 1642 | 1643 | - [ ] 斯坦福: 编程范例 (17 个视频) 1644 | - [C 和 C++ 课程](https://www.youtube.com/watch?v=jTSvthW34GU&list=PLC0B8B318B7394B6F&nohtml5=False) 1645 | 1646 | - [ ] [密码学导论](https://www.youtube.com/watch?v=2aHkqB2-46k&feature=youtu.be) 1647 | - [本系列更多内容 (不分先后顺序)](https://www.youtube.com/channel/UC1usFRN4LCMcfIV7UjHNuQg) 1648 | 1649 | - [ ] [大数据 - 斯坦福大学 (94 个视频)](https://www.youtube.com/playlist?list=PLLssT5z_DsK9JDLcT8T62VtzwyW9LNepV) 1650 | 1651 | ## 计算机科学课程 1652 | 1653 | - [ 在线 CS 课程目录 ](https://github.com/open-source-society/computer-science) 1654 | - [CS 课程目录 (一些是在线讲座)](https://github.com/prakhar1989/awesome-courses) 1655 | -------------------------------------------------------------------------------- /extras/cheat sheets/C Reference Card (ANSI) 2.2.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hymntaha/google-interview-university/9b674e60ec2e02fbd96b90e565d04420e42e49d8/extras/cheat sheets/C Reference Card (ANSI) 2.2.pdf -------------------------------------------------------------------------------- /extras/cheat sheets/Cpp_reference.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hymntaha/google-interview-university/9b674e60ec2e02fbd96b90e565d04420e42e49d8/extras/cheat sheets/Cpp_reference.pdf -------------------------------------------------------------------------------- /extras/cheat sheets/STL Quick Reference 1.29.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hymntaha/google-interview-university/9b674e60ec2e02fbd96b90e565d04420e42e49d8/extras/cheat sheets/STL Quick Reference 1.29.pdf -------------------------------------------------------------------------------- /extras/cheat sheets/bits-cheat-cheet.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hymntaha/google-interview-university/9b674e60ec2e02fbd96b90e565d04420e42e49d8/extras/cheat sheets/bits-cheat-cheet.pdf -------------------------------------------------------------------------------- /extras/cheat sheets/python-cheat-sheet-v1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hymntaha/google-interview-university/9b674e60ec2e02fbd96b90e565d04420e42e49d8/extras/cheat sheets/python-cheat-sheet-v1.pdf -------------------------------------------------------------------------------- /extras/cheat sheets/system-design.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hymntaha/google-interview-university/9b674e60ec2e02fbd96b90e565d04420e42e49d8/extras/cheat sheets/system-design.pdf -------------------------------------------------------------------------------- /extras/future-googler-preview.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hymntaha/google-interview-university/9b674e60ec2e02fbd96b90e565d04420e42e49d8/extras/future-googler-preview.png -------------------------------------------------------------------------------- /extras/future-googler.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/hymntaha/google-interview-university/9b674e60ec2e02fbd96b90e565d04420e42e49d8/extras/future-googler.pdf -------------------------------------------------------------------------------- /programming-language-resources.md: -------------------------------------------------------------------------------- 1 | ## Programming Language Resources 2 | 3 | - C 4 | - [ANSI C Cheat Sheet](https://github.com/jwasham/google-interview-university/blob/master/extras/cheat%20sheets/C%20Reference%20Card%20(ANSI)%202.2.pdf) 5 | - K&R C book (ANSI C) 6 | - [Make, Clang (video)](https://www.youtube.com/watch?v=U3zCxnj2w8M) 7 | - GDB: 8 | - [Harvard CS50 - GDB (video)](https://www.youtube.com/watch?v=USPvePv1uzE) 9 | - [Harvard CS50 - GDB (video)](https://www.youtube.com/watch?v=y5JmQItfFck) 10 | - [Valgrind (video)](https://www.youtube.com/watch?v=fvTsFjDuag8) 11 | 12 | - C++ 13 | - [C++ Cheat Sheet](https://github.com/jwasham/google-interview-university/blob/master/extras/cheat%20sheets/Cpp_reference.pdf) 14 | - [STL Cheat Sheet](https://github.com/jwasham/google-interview-university/blob/master/extras/cheat%20sheets/STL%20Quick%20Reference%201.29.pdf) 15 | - basics 16 | - pointers 17 | - functions 18 | - references 19 | - templates 20 | - compilation 21 | - scope & linkage 22 | - namespaces 23 | - OOP 24 | - STL 25 | - [functors](http://www.cprogramming.com/tutorial/functors-function-objects-in-c++.html) 26 | - [C++ at Google (video)](https://www.youtube.com/watch?v=NOCElcMcFik) 27 | - [Google C++ Style Guide](https://google.github.io/styleguide/cppguide.html) 28 | - Google uses clang-format (there is a command line "style" argument: -style=google) 29 | - [Efficiency with Algorithms, Performance with Data Structures (video)](https://youtu.be/fHNmRkzxHWs) 30 | - [Review of C++ concepts (video)](https://www.youtube.com/watch?v=Rub-JsjMhWY) 31 | 32 | - Python 33 | - [Python Cheat Sheet](https://github.com/jwasham/google-interview-university/blob/master/extras/cheat%20sheets/python-cheat-sheet-v1.pdf) 34 | - [Python in One Video](https://www.youtube.com/watch?v=N4mEzFDjqtA) 35 | - [Series on 3.4 (video)](https://www.youtube.com/playlist?list=PL6gx4Cwl9DGAcbMi1sH6oAMk4JHw91mC_) 36 | - [Zero to Hero (video)](https://www.youtube.com/watch?v=emY34tSKXc4) 37 | - [Statistics for Hackers (video)](https://www.youtube.com/watch?v=Iq9DzN6mvYA) 38 | - [Faster Python (video)](https://www.youtube.com/watch?v=JDSGVvMwNM8) 39 | - [CPython Walk (video)](https://www.youtube.com/watch?v=LhadeL7_EIU&list=PLzV58Zm8FuBL6OAv1Yu6AwXZrnsFbbR0S&index=6) 40 | - [10 Tips for Pythonic Code (video)](https://www.youtube.com/watch?v=_O23jIXsshs) 41 | - [Beyond PEP 8 -- Best practices for beautiful intelligible code (video)](https://www.youtube.com/watch?v=wf-BqAjZb8M) 42 | 43 | - Java 44 | - [Stanford CS106A - Programming Methodology (video)](https://see.stanford.edu/Course/CS106A) 45 | - [Software Construction In Java (video)](https://www.edx.org/course/software-construction-java-mitx-6-005-1x) 46 | - [Introduction To Programming In Java](http://introcs.cs.princeton.edu/java/home/) 47 | - [Algorithms 4th Ed - Algorithm Book In Java](http://algs4.cs.princeton.edu/home/) 48 | - Go 49 | - [The Go programming Language](https://golang.org/) 50 | - [The Go programming Language (book)](http://www.gopl.io/) 51 | - [A Tour of Go](https://tour.golang.org/) 52 | - [Effective Go](https://golang.org/doc/effective_go.html) 53 | - [Go Wiki](https://golang.org/wiki) 54 | - [Go at Google: Language Design in the Service of Software Engineering](https://talks.golang.org/2012/splash.article) 55 | - [Go Proverbs](http://go-proverbs.github.io/) 56 | - [Go Proverbs - Rob Pike (video)](https://www.youtube.com/watch?v=PAAkCSZUG1c) 57 | - Other Language 1 58 | - Other Language 2 59 | - etc 60 | --------------------------------------------------------------------------------