- [Aggregators] (#aggregators)
- [Algorithm Articles] (#algorithm-articles)
- [Courses] (#courses)
- [Interview Tips] (#interview-tips)
- [Problems] (#problems)
- [System Design Interviews] (#sytem-design-interviews)
- [Questions] (#questions)
- Comprehensive article list for system design interview [[github][ag_system_design]]
- Everything you need to kick ass on your coding interview [[github][ag_all_you_need]]
- Good list of books & websites to practice. Also, providing weekly update mails [[web][ag_coding_interview]] [ag_system_design]: https://github.com/checkcheckzz/system-design-interview [ag_all_you_need]: https://github.com/andreis/interview [ag_coding_interview]: http://codingforinterviews.com/practice
- Binary Indexed Tree [[top_coder][a_bin]]
- Design algorithms for map-reduce [[blog][a_map_reduce_algo]]
- Union Find (super easy-to-understand) -> MST (Kruskal) & Euler Cycles (tours) [[pdf][a_union_find]]
- Asymtotic Time Complexity Analysis (in terms of T(n) function) [[slide][a_asym_time]] [a_bin]: https://www.topcoder.com/community/data-science/data-science-tutorials/binary-indexed-trees/ [a_union_find]: http://www.cs.cornell.edu/~wdtseng/icpc/notes/graph_part4.pdf [a_map_reduce_algo]: http://horicky.blogspot.com/2010/08/designing-algorithmis-for-map-reduce.html [a_asym_time]: http://www.cs.cornell.edu/courses/cs211/2005sp/lectures/l14-bigo/l14-15-complexity.4up.pdf
- Udemy course to "Ace Your Coding Interview & Land Your Dream Programming Job" [[udemy][c_udemy_course]] [c_udemy_course]: https://www.udemy.com/programming-code-interview/?couponCode=NEWSLETTER-COURSE-FRIENDS
- Burst Balloon [[web1][prob_burst_balloon1], [web2][prob_burst_balloon2]] [prob_burst_balloon1]: https://kennyzhuang.gitbooks.io/algorithms-collection/content/burst_balloons.html [prob_burst_balloon2]: https://leetcode.com/discuss/72216/share-some-analysis-and-explanations
- Tips on writing test cases in the interview [[web][i_testcases]] [i_testcases]: http://blogs.msdn.com/b/jmstall/archive/2006/12/07/interiew-tip-testing.aspx
- MUST WATCH - CS75 (Summer 2012) Lecture 9 Scalability Harvard Web Development David Malan 11:13 [[youtube][sys_cs75]]
- Consistent Hashing [[web][sys_consist_hash]] [sys_cs75]: https://www.youtube.com/watch?v=-W9F__D3oY4 [sys_consist_hash]: http://n00tc0d3r.blogspot.com/2013/09/big-data-consistent-hashing.html
- 3 Graph representations & pros/cons you should know [[stackoverflow][q_graph_representation]]
- Understand Knapsack & NP Complete [[stackoverflow][q_knapsack_np_complete]] [q_knapsack_np_complete]: http://stackoverflow.com/questions/3907545/how-to-understand-the-knapsack-problem-is-np-complete [q_graph_representation]: http://stackoverflow.com/questions/5886274/comparing-object-graph-representation-to-adjacency-list-and-matrix-representatio