001 Overview (Please Watch) (35.3 MB)
002 Code Editor (109.98 MB)
001 Big O Intro (11.34 MB)
002 Big O Worst Case (4.48 MB)
003 Big O O(n) (9.7 MB)
005 Big O Drop Constants (9.2 MB)
006 Big O O(n^2) (9.55 MB)
008 Big O Drop Non-Dominants (11.46 MB)
009 Big O O(1) (5.97 MB)
010 Big O O(log n) (18.06 MB)
011 Big O Different Terms for Inputs (9.4 MB)
012 Big O Lists (14.34 MB)
013 Big O Wrap Up (64.06 MB)
001 Classes (32.04 MB)
002 Pointers (41.2 MB)
001 Linked List Intro (8.06 MB)
002 LL Big O (26.83 MB)
003 LL Under the Hood (22.77 MB)
004 LL Constructor (36.16 MB)
006 LL Print List (5.45 MB)
007 LL Append (29.51 MB)
008 LL Pop Intro (17.46 MB)
009 LL Pop Code (55.17 MB)
010 LL Prepend (26.34 MB)
011 LL Pop First (31.55 MB)
012 LL Get (22.56 MB)
013 LL Set (23.32 MB)
014 LL Insert (40.73 MB)
015 LL Remove (34.44 MB)
016 LL Reverse (38.83 MB)
001 DLL Constructor (22.34 MB)
002 DLL Append (25.23 MB)
003 DLL Pop (47.7 MB)
004 DLL Prepend (20.79 MB)
005 DLL Pop First (28.81 MB)
006 DLL Get (31.77 MB)
007 DLL Set (21.85 MB)
008 DLL Insert (34.12 MB)
009 DLL Remove (33.78 MB)
001 Stack Intro (22.49 MB)
002 Stack Constructor (13.49 MB)
003 Stack Push (16.82 MB)
004 Stack Pop (20.33 MB)
005 Queue Intro (10.66 MB)
006 Queue Constructor (16.5 MB)
007 Queue Enqueue (20.37 MB)
008 Queue Dequeue (26.54 MB)
001 Trees Intro & Terminology (19.3 MB)
002 Binary Search Trees Example (9.24 MB)
003 BST Big O (35.99 MB)
004 BST Constructor (24.39 MB)
005 BST Insert - Intro (27.87 MB)
006 BST Insert - Code (61.66 MB)
007 BST Contains (61.21 MB)
001 Hash Table Intro (17.41 MB)
002 HT Collisions (9.54 MB)
003 HT Constructor (20.28 MB)
004 HT Set (21.9 MB)
005 HT Get (26.94 MB)
006 HT Keys (15.15 MB)
007 HT Big O (10.76 MB)
008 HT Interview Question (26.69 MB)
001 Graph Intro (10.66 MB)
002 Graph Adjacency Matrix (11.52 MB)
003 Graph Adjacency List (5.93 MB)
004 Graph Big O (33.9 MB)
005 Graph Add Vertex (14.11 MB)
006 Graph Add Edge (13.11 MB)
007 Graph Remove Edge (35.87 MB)
008 Graph Remove Vertex (28.59 MB)
001 Heap Intro (28.44 MB)
002 Heap Insert (Intro) (17.81 MB)
003 Heap Helper Methods (14.19 MB)
004 Heap Insert (Code) (39.94 MB)
005 Heap Remove (25.04 MB)
006 Heap Sink Down (65.15 MB)
007 Heap Priority Queues & Big O (17.59 MB)
001 Recursion Intro (29.24 MB)
002 Call Stack (40.5 MB)
003 Factorial (46.99 MB)
001 rBST Contains (36.02 MB)
002 rBST Insert (44.08 MB)
003 rBST Delete Intro (11.5 MB)
004 rBST Delete Code (1 of 3) (37.02 MB)
005 rBST Delete Code (2 of 3) (33.82 MB)
006 rBST Minimum Value (24.56 MB)
007 rBST Delete Code (3 of 3) (33.6 MB)
001 Tree Traversal Intro (6.95 MB)
002 BFS (Breadth First Search) Intro (12.86 MB)
003 BFS Code (39.56 MB)
004 DFS (Depth First Search) PreOrder - Intro (4.46 MB)
005 DFS PreOrder - Code (49.79 MB)
006 DFS PostOrder - Intro (6.93 MB)
007 DFS PostOrder - Code (44.2 MB)
008 DFS InOrder - Intro (6.65 MB)
009 DFS InOrder - Code (44.72 MB)
001 Bubble Sort Intro (6.4 MB)
002 Bubble Sort Code (14.92 MB)
003 Selection Sort Intro (8.76 MB)
004 Selection Sort Code (26.99 MB)
005 Insertion Sort Intro (4.53 MB)
006 Insertion Sort Code (22.29 MB)
007 Insertion Sort Big O (3.7 MB)
001 Merge Sort Overview (7.14 MB)
002 Merge Intro (5.42 MB)
003 Merge Code (17.16 MB)
004 Merge Sort Intro (7.96 MB)
005 Merge Sort Code (59.22 MB)
006 Merge Sort Big O (14.19 MB)
001 Quick Sort Intro (6.57 MB)
002 Pivot Intro (8.16 MB)
003 Pivot Code (30.14 MB)
004 Quick Sort Code (31.96 MB)
005 Quick Sort Big O (12.17 MB)
001 Overlapping Subproblems (15.77 MB)
002 Optimized Substructure (11.5 MB)
003 Fibonacci Sequence (51.38 MB)
004 Memoization (72.68 MB)
005 Bottom Up (31.46 MB)