From 51addfdd607bf2edbedd5eb123258b9e64e7e671 Mon Sep 17 00:00:00 2001 From: Sinan Bolel Date: Mon, 5 Jun 2017 05:26:55 -0500 Subject: [PATCH 1/5] fix(gitignore): comments --- .gitignore | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.gitignore b/.gitignore index ab7de4e..4023448 100644 --- a/.gitignore +++ b/.gitignore @@ -1,6 +1,6 @@ .idea personal-9894.md -// Targets Windows & Unix temporary files +# Targets Windows & Unix temporary files ~$* *~ From 8c60020e2d11cdc463d76401ab0fadc209abb533 Mon Sep 17 00:00:00 2001 From: Marlon Aviz Date: Fri, 9 Jun 2017 11:34:08 -0300 Subject: [PATCH 2/5] added hyperlink to video series --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index d2af6c0..32a9e64 100644 --- a/README.md +++ b/README.md @@ -1273,7 +1273,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th - [ ] Twitter: - [O'Reilly MySQL CE 2011: Jeremy Cole, "Big and Small Data at @Twitter" (video)](https://www.youtube.com/watch?v=5cKTP36HVgI) - [Timelines at Scale](https://www.infoq.com/presentations/Twitter-Timeline-Scalability) - - For even more, see "Mining Massive Datasets" video series in the Video Series section. + - For even more, see "Mining Massive Datasets" video series in the [Video Series](#video-series) section. - [ ] Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world: - review: [The System Design Primer](https://github.com/donnemartin/system-design-primer) - [System Design from HiredInTech](http://www.hiredintech.com/system-design/) From 0b2b061eaf61fc6bedfea83a3195c65d4efd852a Mon Sep 17 00:00:00 2001 From: Marlon Aviz Date: Sun, 11 Jun 2017 13:45:17 -0300 Subject: [PATCH 3/5] fixed technical term --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 32a9e64..4810195 100644 --- a/README.md +++ b/README.md @@ -1715,7 +1715,7 @@ software engineer, and to be aware of certain technologies and algorithms, so yo hashcodes, a Red-Black tree is used. - [ ] [Aduni - Algorithms - Lecture 4 (link jumps to starting point) (video)](https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871) - [ ] [Aduni - Algorithms - Lecture 5 (video)](https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5) - - [ ] [Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree) + - [ ] [Red-Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree) - [ ] [An Introduction To Binary Search And Red Black Tree](https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-binary-search-and-red-black-trees/) - [ ] **2-3 search trees** From 426326b4a2501b4d7ab2b3c47aac281eee7c6965 Mon Sep 17 00:00:00 2001 From: Marlon Aviz Date: Sun, 11 Jun 2017 17:30:10 -0300 Subject: [PATCH 4/5] Changed duplicate resource --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 32a9e64..7bfae26 100644 --- a/README.md +++ b/README.md @@ -1770,7 +1770,7 @@ software engineer, and to be aware of certain technologies and algorithms, so yo - [ ] [For animations and a little more detail](https://en.wikipedia.org/wiki/Skip_list) - ### Network Flows - - [ ] [Ford-Fulkerson in 5 minutes (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0) + - [ ] [Ford-Fulkerson in 5 minutes — Step by step example (video)](https://www.youtube.com/watch?v=Tl90tNtKvxs) - [ ] [Ford-Fulkerson Algorithm (video)](https://www.youtube.com/watch?v=v1VgJmkEJW0) - [ ] [Network Flows (video)](https://www.youtube.com/watch?v=2vhN4Ice5jI) From 2291ef40a0cb40467c8af8b2a8a826411b2126ba Mon Sep 17 00:00:00 2001 From: Marlon Aviz Date: Sun, 11 Jun 2017 18:43:05 -0300 Subject: [PATCH 5/5] Fixed broken anchors and removed duplicate in index --- README.md | 9 ++++----- 1 file changed, 4 insertions(+), 5 deletions(-) diff --git a/README.md b/README.md index 32a9e64..3894cc3 100644 --- a/README.md +++ b/README.md @@ -129,8 +129,8 @@ If you want to be a reliability engineer or systems engineer, study more from th - [Compilers](#compilers) - [Emacs and vi(m)](#emacs-and-vim) - [Unix command line tools](#unix-command-line-tools) - - [Information theory](#information-theory) - - [Parity & Hamming Code](#parity--hamming-code) + - [Information theory](#information-theory-videos) + - [Parity & Hamming Code](#parity--hamming-code-videos) - [Entropy](#entropy) - [Cryptography](#cryptography) - [Compression](#compression) @@ -145,7 +145,6 @@ If you want to be a reliability engineer or systems engineer, study more from th - [Locality-Sensitive Hashing](#locality-sensitive-hashing) - [van Emde Boas Trees](#van-emde-boas-trees) - [Augmented Data Structures](#augmented-data-structures) - - [N-ary (K-ary, M-ary) trees](#n-ary-k-ary-m-ary-trees) - [Balanced search trees](#balanced-search-trees) - AVL trees - Splay trees @@ -160,8 +159,8 @@ If you want to be a reliability engineer or systems engineer, study more from th - [Disjoint Sets & Union Find](#disjoint-sets--union-find) - [Math for Fast Processing](#math-for-fast-processing) - [Treap](#treap) - - [Linear Programming](#linear-programming) - - [Geometry, Convex hull](#geometry-convex-hull) + - [Linear Programming](#linear-programming-videos) + - [Geometry, Convex hull](#geometry-convex-hull-videos) - [Discrete math](#discrete-math) - [Machine Learning](#machine-learning) - [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)