我们官网为硅谷圈儿的朋友准备了大量实用干货,欢迎访问
内容均为原创,仅作学习交流使用,禁止任何形式商业用途的转载。
https://aonecode.com/
[Amazon] Online Assessment 1:https://aonecode.com/getArticle/215
[Twitter] Tweet Recommendation:https://aonecode.com/getArticle/214
[Twitter] Hacking Time:https://aonecode.com/getArticle/213
[Twitter] Employees Per Department:https://aonecode.com/getArticle/212
[Dropbox] Design Hit Counter:https://aonecode.com/getArticle/211
[LinkedIn] Weighted Random Selection:https://aonecode.com/getArticle/210
[LinkedIn] Tournament Tree:https://aonecode.com/getArticle/209
[Google] Play Cards:https://aonecode.com/getArticle/208
[Google] Periodic String:https://aonecode.com/getArticle/207
[Google] Simulate Rain:https://aonecode.com/getArticle/206
[Google] Add to All Collection:https://aonecode.com/getArticle/205
[FB] Find Area of Room by Robot:https://aonecode.com/getArticle/201
[FB] Convert BST to Double Linked List:https://aonecode.com/getArticle/202
Flatten Nested Linked List:https://aonecode.com/getArticle/203
[FB] Longest Arithmetic Progression:https://aonecode.com/getArticle/204
[FB真题] Recover BSTs from Preorders:https://aonecode.com/getArticle/13
Find Comments in Code:https://aonecode.com/getArticle/3
String List Serialization:https://aonecode.com/getArticle/4
[U家真题] O(1) GetRandomKey Map:https://aonecode.com/getArticle/12
strStr KMP Algorithm:https://aonecode.com/getArticle/14
DFS vs BFS:https://aonecode.com/getArticle/5
Tree Traversal:https://aonecode.com/getArticle/6
Morris Tree Traversal:https://aonecode.com/getArticle/9
Cycle in Graphs:https://aonecode.com/getArticle/7
Linked List Basics:https://aonecode.com/getArticle/1
Topological Sort:https://aonecode.com/getArticle/8
Coding Interview FAQ:https://aonecode.com/getArticle/100
[Must Read] Design a Scalable System:https://aonecode.com/getArticle/1000
TCP vs UDP:https://aonecode.com/getArticle/11
本文来自企鹅号 - A1Code媒体
如有侵权,请联系 cloudcommunity@tencent.com 删除。
本文来自企鹅号 - A1Code媒体
如有侵权,请联系 cloudcommunity@tencent.com 删除。