Algorithms Part I – II

2016
28:27 hours

│ ├── Lectures Part 1
│ │ ├── week0
│ │ │ └── Algorithms Part I 0.0 Course Introduction (922) ✐ Quiz Attempted.mp4
│ │ ├── week1
│ │ │ ├── 01-union-find
│ │ │ │ ├── Algorithms Part I 1.0 Dynamic Connectivity (1022) ✐ Quiz Attempted.mp4
│ │ │ │ ├── Algorithms Part I 1.1 Quick Find (1018) ✐ Quiz Attempted.mp4
│ │ │ │ ├── Algorithms Part I 1.2 Quick Union (750) ✐ Quiz Attempted.mp4
│ │ │ │ ├── Algorithms Part I 1.3 Quick-Union Improvements (1302) ✐ Quiz Attempted.mp4
│ │ │ │ └── Algorithms Part I 1.4 Union-Find Applications (922).mp4
│ │ │ └── 02-analysis-of-algorithms
│ │ │ ├── Algorithms Part I 2.0 Analysis of Algorithms Introduction (814) ✐ Quiz Attempted.mp4
│ │ │ ├── Algorithms Part I 2.1 Observations (1005) ✐ Quiz Attempted.mp4
│ │ │ ├── Algorithms Part I 2.2 Mathematical Models (1248) ✐ Quiz Attempted.mp4
│ │ │ ├── Algorithms Part I 2.3 Order-of-Growth Classifications (1439) ✐ Quiz Attempted.mp4
│ │ │ ├── Algorithms Part I 2.4 Theory of Algorithms (1135).mp4
│ │ │ └── Algorithms Part I 2.5 Memory (811).mp4
│ │ ├── week2
│ │ │ ├── 01-stacks-and-queues
│ │ │ │ ├── Algorithms Part I 3.0 Stacks (1624).mp4
│ │ │ │ ├── Algorithms Part I 3.1 Resizing Arrays (956).mp4
│ │ │ │ ├── Algorithms Part I 3.2 Queues (433).mp4
│ │ │ │ ├── Algorithms Part I 3.3 Generics (926).mp4
│ │ │ │ ├── Algorithms Part I 3.4 Iterators (716).mp4
│ │ │ │ └── Algorithms Part I 3.5 Stack and Queue Applications (1325) (optional).mp4
│ │ │ └── 02-elementary-sorts
│ │ │ ├── Algorithms Part I 4.0 Sorting Introduction (1443).mp4
│ │ │ ├── Algorithms Part I 4.1 Selection Sort (659).mp4
│ │ │ ├── Algorithms Part I 4.2 Insertion Sort (928).mp4
│ │ │ ├── Algorithms Part I 4.3 Shellsort (1048).mp4
│ │ │ ├── Algorithms Part I 4.4 Shuffling (739).mp4
│ │ │ └── Algorithms Part I 4.5 Convex Hull (1350).mp4
│ │ ├── week3
│ │ │ ├── 01-mergesort
│ │ │ │ ├── Algorithms Part I 5.0 Mergesort (2354).mp4
│ │ │ │ ├── Algorithms Part I 5.1 Bottom-up Mergesort (320).mp4
│ │ │ │ ├── Algorithms Part I 5.2 Sorting Complexity (905).mp4
│ │ │ │ ├── Algorithms Part I 5.3 Comparators (643).mp4
│ │ │ │ └── Algorithms Part I 5.4 Stability (539).mp4
│ │ │ └── 02-quicksort
│ │ │ ├── Algorithms Part I 6.0 Quicksort (1933).mp4
│ │ │ ├── Algorithms Part I 6.1 Selection (708).mp4
│ │ │ ├── Algorithms Part I 6.2 Duplicate Keys (1125).mp4
│ │ │ └── Algorithms Part I 6.3 System Sorts (1150).mp4
│ │ ├── week4
│ │ │ ├── 01-priority-queues
│ │ │ │ ├── Algorithms Part I 7.0 APIs and Elementary Implementations (1252).mp4
│ │ │ │ ├── Algorithms Part I 7.1 Binary Heaps (2336).mp4
│ │ │ │ ├── Algorithms Part I 7.2 Heapsort (1429).mp4
│ │ │ │ └── Algorithms Part I 7.3 Event-Driven Simulation (2238) (optional).mp4
│ │ │ └── 02-elementary-symbol-tables
│ │ │ ├── Algorithms Part I 8.0 Symbol Table API (2130).mp4
│ │ │ ├── Algorithms Part I 8.1 Elementary Implementations (903).mp4
│ │ │ ├── Algorithms Part I 8.2 Ordered Operations (626).mp4
│ │ │ ├── Algorithms Part I 8.3 Binary Search Trees (1956).mp4
│ │ │ ├── Algorithms Part I 8.4 Ordered Operations in BSTs (1031).mp4
│ │ │ └── Algorithms Part I 8.5 Deletion in BSTs (952).mp4
│ │ ├── week5
│ │ │ ├── 01-balanced-search-tree
│ │ │ │ ├── Algorithms Part I 9.0 2-3 Search Trees (1655).mp4
│ │ │ │ ├── Algorithms Part I 9.1 Red-Black BSTs (3530).mp4
│ │ │ │ └── Algorithms Part I 9.2 B-Trees (1036) (optional).mp4
│ │ │ └── 02-geometric-applications-of-BSTs
│ │ │ ├── Algorithms Part I 10.0 1d Range Search (851).mp4
│ │ │ ├── Algorithms Part I 10.1 Line Segment Intersection (546).mp4
│ │ │ ├── Algorithms Part I 10.2 Kd-Trees (2907).mp4
│ │ │ ├── Algorithms Part I 10.3 Interval Search Trees (1347).mp4
│ │ │ └── Algorithms Part I 10.4 Rectangle Intersection (810).mp4
│ │ └── week6
│ │ └── 01-hashtables
│ │ ├── Algorithms Part I 11.0 Hash Functions (1813).mp4
│ │ ├── Algorithms Part I 11.1 Separate Chaining (728).mp4
│ │ ├── Algorithms Part I 11.2 Linear Probing (1437).mp4
│ │ ├── Algorithms Part I 11.3 Hash Table Context (1009).mp4
│ │ ├── Algorithms Part I 11.4 Symbol Table Applications Sets (504) (optional).mp4
│ │ ├── Algorithms Part I 11.5 Symbol Table Applications Dictionary Clients (540) (optional).mp4
│ │ ├── Algorithms Part I 11.6 Symbol Table Applications Indexing Clients (857) (optional).mp4
│ │ └── Algorithms Part I 11.7 Symbol Table Applications Sparse Vectors (741) (optional).mp4
└── Coursera – Algorithms Part 2 by Kevin Wayne
├── book
│ └── Robert Sedgewick_ Kevin Daniel Wayne-Algorithms-Addison-Wesley (2011).pdf
├── job-interview-questions
│ ├── week1
│ │ ├── 01-undirected-graphs
│ │ │ ├── hints.txt
│ │ │ └── questions.txt
│ │ └── 02-directed-graphs
│ │ ├── hints.txt
│ │ └── questions.txt
│ ├── week2
│ │ ├── 01-minimum-spanning-trees
│ │ │ ├── hints.txt
│ │ │ └── questions.txt
│ │ └── 02-shortest-paths
│ │ ├── hints.txt
│ │ └── questions.txt
│ ├── week3
│ │ ├── 01-maximum-flow
│ │ │ ├── hints.txt
│ │ │ └── questions.txt
│ │ └── 02-radix-sorts
│ │ ├── hints.txt
│ │ └── questions.txt
│ ├── week5
│ │ ├── 01-tries.png
│ │ └── 02-substring-search.png
│ ├── week6
│ │ ├── 01-regular-expressions.png
│ │ └── 02-data-compression.png
│ └── week7
│ ├── 01-reductions.png
│ ├── 02-intractability.png
│ └── 03-linear-programming.png
├── Lectures Part 2
│ ├── week0
│ │ └── Algorithms Part II 0.0 Course Introduction (922).mp4
│ ├── week1
│ │ ├── 01-undirected-graphs
│ │ │ ├── Algorithms Part II 1.0 Introduction to Graphs (932).mp4
│ │ │ ├── Algorithms Part II 1.1 Graph API (1447).mp4
│ │ │ ├── Algorithms Part II 1.2 Depth-First Search (2622).mp4
│ │ │ ├── Algorithms Part II 1.3 Breadth-First Search (1334).mp4
│ │ │ ├── Algorithms Part II 1.4 Connected Components (1856).mp4
│ │ │ └── Algorithms Part II 1.5 Graph Challenges (1429).mp4
│ │ └── 02-directed-graphs
│ │ ├── Algorithms Part II 2.0 Introduction to Digraphs (830).mp4
│ │ ├── Algorithms Part II 2.1 Digraph API (456).mp4
│ │ ├── Algorithms Part II 2.2 Digraph Search (2056).mp4
│ │ ├── Algorithms Part II 2.3 Topological Sort (1254).mp4
│ │ └── Algorithms Part II 2.4 Strong Components (2022).mp4
│ ├── week2
│ │ ├── 01-minimum-spanning-trees
│ │ │ ├── Algorithms Part II 3.0 Introduction to MSTs (404).mp4
│ │ │ ├── Algorithms Part II 3.1 Greedy Algorithm (1256).mp4
│ │ │ ├── Algorithms Part II 3.2 Edge-Weighted Graph API (1115).mp4
│ │ │ ├── Algorithms Part II 3.3 Kruskal’s Algorithm (1228).mp4
│ │ │ ├── Algorithms Part II 3.4 Prim’s Algorithm (3315).mp4
│ │ │ └── Algorithms Part II 3.5 MST Context (1034).mp4
│ │ └── 02-shortest-paths
│ │ ├── Algorithms Part II 4.0 Shortest Paths APIs (1051).mp4
│ │ ├── Algorithms Part II 4.1 Shortest Path Properties (1446).mp4
│ │ ├── Algorithms Part II 4.2 Dijkstra’s Algorithm (1858).mp4
│ │ ├── Algorithms Part II 4.3 Edge-Weighted DAGs (1923).mp4
│ │ └── Algorithms Part II 4.4 Negative Weights (2101).mp4
│ ├── week3
│ │ ├── 01-maximum-flow
│ │ │ ├── Algorithms Part II 5.0 Introduction to Maxflow (1033).mp4
│ │ │ ├── Algorithms Part II 5.1 Ford-Fulkerson Algorithm (632).mp4
│ │ │ ├── Algorithms Part II 5.2 Maxflow-Mincut Theorem (938).mp4
│ │ │ ├── Algorithms Part II 5.3 Running Time Analysis (8-49).mp4
│ │ │ ├── Algorithms Part II 5.4 Java Implementation (14-29).mp4
│ │ │ └── Algorithms Part II 5.5 Maxflow Applications (22-20).mp4
│ │ └── 02-radix-sorts
│ │ ├── Algorithms Part II 6.0 Strings in Java (17-43).mp4
│ │ ├── Algorithms Part II 6.1 Key-Indexed Counting (12-06).mp4
│ │ ├── Algorithms Part II 6.2 LSD Radix Sort (15-00).mp4
│ │ ├── Algorithms Part II 6.3 MSD Radix Sort (13-41).mp4
│ │ ├── Algorithms Part II 6.4 3-way Radix Quicksort (7-22).mp4
│ │ └── Algorithms Part II 6.5 Suffix Arrays (1925).mp4
│ ├── week5
│ │ ├── 01-tries
│ │ │ ├── Algorithms Part II 7.0 R-way Tries (3219).mp4
│ │ │ ├── Algorithms Part II 7.1 Ternary Search Tries (2242).mp4
│ │ │ └── Algorithms Part II 7.2 Character-Based Operations (2003).mp4
│ │ └── 02-substring-search
│ │ ├── Algorithms Part II 8.0 Introduction to Substring Search (642).mp4
│ │ ├── Algorithms Part II 8.1 Brute-Force Substring Search (1011).mp4
│ │ ├── Algorithms Part II 8.2 Knuth-Morris-Pratt (3314).mp4
│ │ ├── Algorithms Part II 8.3 Boyer-Moore (836).mp4
│ │ └── Algorithms Part II 8.4 Rabin-Karp (1613).mp4
│ ├── week6
│ │ ├── 01-regular-expressions
│ │ │ ├── Algorithms Part II 9.0 Regular Expressions (2003).mp4
│ │ │ ├── Algorithms Part II 9.1 REs and NFAs (1314).mp4
│ │ │ ├── Algorithms Part II 9.2 NFA Simulation (1827).mp4
│ │ │ ├── Algorithms Part II 9.3 NFA Construction (1142).mp4
│ │ │ └── Algorithms Part II 9.4 Regular Expression Applications (2009).mp4
│ │ └── 02-data-compression
│ │ ├── Algorithms Part II 10.0 Introduction to Data Compression (2227).mp4
│ │ ├── Algorithms Part II 10.1 Run-Length Coding (559).mp4
│ │ ├── Algorithms Part II 10.2 Huffman Compression (2414).mp4
│ │ └── Algorithms Part II 10.3 LZW Compression (2733).mp4
│ └── week7
│ ├── 01-reductions
│ │ ├── Algorithms Part II 11.0 Introduction to Reductions (925).mp4
│ │ ├── Algorithms Part II 11.1 Designing Algorithms (813).mp4
│ │ ├── Algorithms Part II 11.2 Establishing Lower Bounds (916).mp4
│ │ └── Algorithms Part II 11.3 Classifying Problems (12-45).mp4
│ ├── 02-linear-programming
│ │ ├── Algorithms Part II 12.0 Brewer-‘s Problem (21-15).mp4
│ │ ├── Algorithms Part II 12.1 Simplex Algorithm (11-49).mp4
│ │ ├── Algorithms Part II 12.2 Simplex Implementations (1621).mp4
│ │ └── Algorithms Part II 12.3 Linear Programming Reductions (11-46).mp4
│ └── 03-intractability
│ ├── Algorithms Part II 13.0 Introduction to Intractability (1700).mp4
│ ├── Algorithms Part II 13.1 Search Problems (1056).mp4
│ ├── Algorithms Part II 13.2 P vs. NP (1629).mp4
│ ├── Algorithms Part II 13.3 Classifying Problems (1343).mp4
│ ├── Algorithms Part II 13.4 NP-Completeness (1238).mp4
│ └── Algorithms Part II 13.5 Coping with Intractability (1401).mp4