Fixed simple ordering mistake in the Graph section

README.md

@@ -129,51 +129,60 @@ software development/engineering roles.
 
 ### Topics of Study
 
-- [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
+- [Coding Interview University](#coding-interview-university)
-- [Data Structures](#data-structures)
+  - [What is it?](#what-is-it)
-    - [Arrays](#arrays)
+  - [Table of Contents](#table-of-contents)
-    - [Linked Lists](#linked-lists)
+    - [The Study Plan](#the-study-plan)
-    - [Stack](#stack)
+    - [Topics of Study](#topics-of-study)
-    - [Queue](#queue)
+    - [Getting the Job](#getting-the-job)
-    - [Hash table](#hash-table)
+    - [Optional Extra Topics & Resources](#optional-extra-topics--resources)
-- [More Knowledge](#more-knowledge)
+  - [Why use it?](#why-use-it)
-    - [Binary search](#binary-search)
+  - [How to use it](#how-to-use-it)
-    - [Bitwise operations](#bitwise-operations)
+  - [Don't feel you aren't smart enough](#dont-feel-you-arent-smart-enough)
-- [Trees](#trees)
+  - [A Note About Video Resources](#a-note-about-video-resources)
-    - [Trees - Notes & Background](#trees---notes--background)
+  - [Choose a Programming Language](#choose-a-programming-language)
-    - [Binary search trees: BSTs](#binary-search-trees-bsts)
+    - [For this Study Plan](#for-this-study-plan)
-    - [Heap / Priority Queue / Binary Heap](#heap--priority-queue--binary-heap)
+    - [For your Coding Interview](#for-your-coding-interview)
-    - balanced search trees (general concept, not details)
+  - [Books for Data Structures and Algorithms](#books-for-data-structures-and-algorithms)
-    - traversals: preorder, inorder, postorder, BFS, DFS
+    - [C](#c)
-- [Sorting](#sorting)
+    - [Python](#python)
-    - selection
+    - [Java](#java)
-    - insertion
+    - [C++](#c-1)
-    - heapsort
+  - [Interview Prep Books](#interview-prep-books)
-    - quicksort
+    - [If you have tons of extra time:](#if-you-have-tons-of-extra-time)
-    - merge sort
+  - [Don't Make My Mistakes](#dont-make-my-mistakes)
-- [Graphs](#graphs)
+    - [1. You Won't Remember it All](#1-you-wont-remember-it-all)
-    - directed
+    - [2. Use Flashcards](#2-use-flashcards)
-    - undirected
+    - [3. Do Coding Interview Questions While You're Learning](#3-do-coding-interview-questions-while-youre-learning)
-    - adjacency matrix
+    - [4. Focus](#4-focus)
-    - adjacency list
+  - [What you won't see covered](#what-you-wont-see-covered)
-    - traversals: BFS, DFS
+  - [The Daily Plan](#the-daily-plan)
-- [Even More Knowledge](#even-more-knowledge)
+  - [Coding Question Practice](#coding-question-practice)
-    - [Recursion](#recursion)
+  - [Coding Problems](#coding-problems)
-    - [Dynamic Programming](#dynamic-programming)
+  - [Let's Get Started](#lets-get-started)
-    - [Design Patterns](#design-patterns)
+  - [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
-    - [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
+  - [Data Structures](#data-structures)
-    - [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
+  - [More Knowledge](#more-knowledge)
-    - [How computers process a program](#how-computers-process-a-program)
+  - [Trees](#trees)
-    - [Caches](#caches)
+  - [Sorting](#sorting)
-    - [Processes and Threads](#processes-and-threads)
+  - [Graphs](#graphs)
-    - [Testing](#testing)
+  - [Even More Knowledge](#even-more-knowledge)
-    - [String searching & manipulations](#string-searching--manipulations)
+  - [Final Review](#final-review)
-    - [Tries](#tries)
+  - [Update Your Resume](#update-your-resume)
-    - [Floating Point Numbers](#floating-point-numbers)
+  - [Find a Job](#find-a-job)
-    - [Unicode](#unicode)
+  - [Interview Process & General Interview Prep](#interview-process--general-interview-prep)
-    - [Endianness](#endianness)
+  - [Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes)
-    - [Networking](#networking)
+  - [Have questions for the interviewer](#have-questions-for-the-interviewer)
-- [Final Review](#final-review)
+  - [Once You've Got The Job](#once-youve-got-the-job)
+  - [Additional Books](#additional-books)
+  - [System Design, Scalability, Data Handling](#system-design-scalability-data-handling)
+  - [Additional Learning](#additional-learning)
+  - [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
+  - [Video Series](#video-series)
+  - [Computer Science Courses](#computer-science-courses)
+  - [Algorithms implementation](#algorithms-implementation)
+  - [Papers](#papers)
+  - [LICENSE](#license)
 
 ### Getting the Job
 
@@ -188,50 +197,60 @@ software development/engineering roles.
 
 ### Optional Extra Topics & Resources
 
-- [Additional Books](#additional-books)
+- [Coding Interview University](#coding-interview-university)
-- [System Design, Scalability, Data Handling](#system-design-scalability-data-handling) (if you have 4+ years experience)
+  - [What is it?](#what-is-it)
-- [Additional Learning](#additional-learning)
+  - [Table of Contents](#table-of-contents)
-    - [Compilers](#compilers)
+    - [The Study Plan](#the-study-plan)
-    - [Emacs and vi(m)](#emacs-and-vim)
+    - [Topics of Study](#topics-of-study)
-    - [Unix command line tools](#unix-command-line-tools)
+    - [Getting the Job](#getting-the-job)
-    - [Information theory](#information-theory-videos)
+    - [Optional Extra Topics & Resources](#optional-extra-topics--resources)
-    - [Parity & Hamming Code](#parity--hamming-code-videos)
+  - [Why use it?](#why-use-it)
-    - [Entropy](#entropy)
+  - [How to use it](#how-to-use-it)
-    - [Cryptography](#cryptography)
+  - [Don't feel you aren't smart enough](#dont-feel-you-arent-smart-enough)
-    - [Compression](#compression)
+  - [A Note About Video Resources](#a-note-about-video-resources)
-    - [Computer Security](#computer-security)
+  - [Choose a Programming Language](#choose-a-programming-language)
-    - [Garbage collection](#garbage-collection)
+    - [For this Study Plan](#for-this-study-plan)
-    - [Parallel Programming](#parallel-programming)
+    - [For your Coding Interview](#for-your-coding-interview)
-    - [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
+  - [Books for Data Structures and Algorithms](#books-for-data-structures-and-algorithms)
-    - [A*](#a)
+    - [C](#c)
-    - [Fast Fourier Transform](#fast-fourier-transform)
+    - [Python](#python)
-    - [Bloom Filter](#bloom-filter)
+    - [Java](#java)
-    - [HyperLogLog](#hyperloglog)
+    - [C++](#c-1)
-    - [Locality-Sensitive Hashing](#locality-sensitive-hashing)
+  - [Interview Prep Books](#interview-prep-books)
-    - [van Emde Boas Trees](#van-emde-boas-trees)
+    - [If you have tons of extra time:](#if-you-have-tons-of-extra-time)
-    - [Augmented Data Structures](#augmented-data-structures)
+  - [Don't Make My Mistakes](#dont-make-my-mistakes)
-    - [Balanced search trees](#balanced-search-trees)
+    - [1. You Won't Remember it All](#1-you-wont-remember-it-all)
-        - AVL trees
+    - [2. Use Flashcards](#2-use-flashcards)
-        - Splay trees
+    - [3. Do Coding Interview Questions While You're Learning](#3-do-coding-interview-questions-while-youre-learning)
-        - Red/black trees
+    - [4. Focus](#4-focus)
-        - 2-3 search trees
+  - [What you won't see covered](#what-you-wont-see-covered)
-        - 2-3-4 Trees (aka 2-4 trees)
+  - [The Daily Plan](#the-daily-plan)
-        - N-ary (K-ary, M-ary) trees
+  - [Coding Question Practice](#coding-question-practice)
-        - B-Trees
+  - [Coding Problems](#coding-problems)
-    - [k-D Trees](#k-d-trees)
+  - [Let's Get Started](#lets-get-started)
-    - [Skip lists](#skip-lists)
+  - [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
-    - [Network Flows](#network-flows)
+  - [Data Structures](#data-structures)
-    - [Disjoint Sets & Union Find](#disjoint-sets--union-find)
+  - [More Knowledge](#more-knowledge)
-    - [Math for Fast Processing](#math-for-fast-processing)
+  - [Trees](#trees)
-    - [Treap](#treap)
+  - [Sorting](#sorting)
-    - [Linear Programming](#linear-programming-videos)
+  - [Graphs](#graphs)
-    - [Geometry, Convex hull](#geometry-convex-hull-videos)
+  - [Even More Knowledge](#even-more-knowledge)
-    - [Discrete math](#discrete-math)
+  - [Final Review](#final-review)
-    - [Machine Learning](#machine-learning)
+  - [Update Your Resume](#update-your-resume)
-- [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
+  - [Find a Job](#find-a-job)
-- [Video Series](#video-series)
+  - [Interview Process & General Interview Prep](#interview-process--general-interview-prep)
-- [Computer Science Courses](#computer-science-courses)
+  - [Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes)
-- [Papers](#papers)
+  - [Have questions for the interviewer](#have-questions-for-the-interviewer)
+  - [Once You've Got The Job](#once-youve-got-the-job)
+  - [Additional Books](#additional-books)
+  - [System Design, Scalability, Data Handling](#system-design-scalability-data-handling)
+  - [Additional Learning](#additional-learning)
+  - [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
+  - [Video Series](#video-series)
+  - [Computer Science Courses](#computer-science-courses)
+  - [Algorithms implementation](#algorithms-implementation)
+  - [Papers](#papers)
+  - [LICENSE](#license)
 
 ---
 
@@ -916,8 +935,8 @@ Graphs can be used to represent many problems in computer science, so this secti
     - [ ] [Depth-First Search](https://www.youtube.com/watch?v=IBfWDYSffUU&t=32s&ab_channel=MITOpenCourseWare)
 
 - [ ] Skiena Lectures - great intro:
-    - [ ] [CSE373 2020 - Lecture 11 - Graph Data Structures (video)](https://www.youtube.com/watch?v=Sjk0xqWWPCc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=10)
+    - [ ] [CSE373 2020 - Lecture 10 - Graph Data Structures (video)](https://www.youtube.com/watch?v=Sjk0xqWWPCc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=10)
-    - [ ] [CSE373 2020 - Lecture 12 - Graph Traversal (video)](https://www.youtube.com/watch?v=ZTwjXj81NVY&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=11)
+    - [ ] [CSE373 2020 - Lecture 11 - Graph Traversal (video)](https://www.youtube.com/watch?v=ZTwjXj81NVY&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=11)
     - [ ] [CSE373 2020 - Lecture 12 - Depth First Search (video)](https://www.youtube.com/watch?v=KyordYB3BOs&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=12)
     - [ ] [CSE373 2020 - Lecture 13 - Minimum Spanning Trees (video)](https://www.youtube.com/watch?v=oolm2VnJUKw&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=13)
     - [ ] [CSE373 2020 - Lecture 14 - Minimum Spanning Trees (con't) (video)](https://www.youtube.com/watch?v=RktgPx0MarY&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=14)