|
@@ -96,6 +96,8 @@ sometimes word-for-word in Google's coaching notes.
|
|
- [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
|
|
- [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
|
|
- [Fast Fourier Transform](#fast-fourier-transform)
|
|
- [Fast Fourier Transform](#fast-fourier-transform)
|
|
- [Bloom Filter](#bloom-filter)
|
|
- [Bloom Filter](#bloom-filter)
|
|
|
|
+ - [HyperLogLog](#hyperloglog)
|
|
|
|
+ - [Locality-Sensitive Hashing](#locality-sensitive-hashing)
|
|
- [van Emde Boas Trees](#van-emde-boas-trees)
|
|
- [van Emde Boas Trees](#van-emde-boas-trees)
|
|
- [Augmented Data Structures](#augmented-data-structures)
|
|
- [Augmented Data Structures](#augmented-data-structures)
|
|
- [Skip lists](#skip-lists)
|
|
- [Skip lists](#skip-lists)
|
|
@@ -1593,6 +1595,14 @@ You're never really done.
|
|
- [Tutorial](http://billmill.org/bloomfilter-tutorial/)
|
|
- [Tutorial](http://billmill.org/bloomfilter-tutorial/)
|
|
- [How To Write A Bloom Filter App](http://blog.michaelschmatz.com/2016/04/11/how-to-write-a-bloom-filter-cpp/)
|
|
- [How To Write A Bloom Filter App](http://blog.michaelschmatz.com/2016/04/11/how-to-write-a-bloom-filter-cpp/)
|
|
|
|
|
|
|
|
+- ### HyperLogLog
|
|
|
|
+ - [How To Count A Billion Distinct Objects Using Only 1.5KB Of Memory](http://highscalability.com/blog/2012/4/5/big-data-counting-how-to-count-a-billion-distinct-objects-us.html)
|
|
|
|
+
|
|
|
|
+- ### Locality-Sensitive Hashing
|
|
|
|
+ - used to determine similarity of documents
|
|
|
|
+ - the opposite of md5 or sha which are used to determine if 2 documents/strings are exactly the same.
|
|
|
|
+ - [Simhashing (hopefully) made simple](http://ferd.ca/simhashing-hopefully-made-simple.html)
|
|
|
|
+
|
|
- ### van Emde Boas Trees
|
|
- ### van Emde Boas Trees
|
|
- [ ] [Divide & Conquer: van Emde Boas Trees (video)](https://www.youtube.com/watch?v=hmReJCupbNU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=6)
|
|
- [ ] [Divide & Conquer: van Emde Boas Trees (video)](https://www.youtube.com/watch?v=hmReJCupbNU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=6)
|
|
- [ ] [MIT Lecture Notes](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)
|
|
- [ ] [MIT Lecture Notes](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)
|
|
@@ -1635,6 +1645,7 @@ You're never really done.
|
|
- [ ] [Linear Programming](https://www.youtube.com/watch?v=M4K6HYLHREQ)
|
|
- [ ] [Linear Programming](https://www.youtube.com/watch?v=M4K6HYLHREQ)
|
|
- [ ] [Finding minimum cost](https://www.youtube.com/watch?v=2ACJ9ewUC6U)
|
|
- [ ] [Finding minimum cost](https://www.youtube.com/watch?v=2ACJ9ewUC6U)
|
|
- [ ] [Finding maximum value](https://www.youtube.com/watch?v=8AA_81xI3ik)
|
|
- [ ] [Finding maximum value](https://www.youtube.com/watch?v=8AA_81xI3ik)
|
|
|
|
+ - [ ] [Solve Linear Equations with Python - Simplex Algorithm](https://www.youtube.com/watch?v=44pAWI7v5Zk)
|
|
|
|
|
|
- ### Geometry, Convex hull (videos)
|
|
- ### Geometry, Convex hull (videos)
|
|
- [ ] [Graph Alg. IV: Intro to geometric algorithms - Lecture 9](https://youtu.be/XIAQRlNkJAw?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3164)
|
|
- [ ] [Graph Alg. IV: Intro to geometric algorithms - Lecture 9](https://youtu.be/XIAQRlNkJAw?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3164)
|