Section 1 : Introduction

 		Lecture 1 Introduction 3:51
Lecture 2 Overview (Please Watch) 3:14
Lecture 3 Code Editor 4:4

Section 2 : Big O

 		Lecture 4 Big O Intro 2:58
Lecture 5 Big O Worst Case 1:29
Lecture 6 Big O O(n) 2:5
Lecture 7 Big O Drop Constants 1:38
Lecture 8 Big O O(n^2) 3:9
Lecture 9 Big O Drop Non-Dominants 1:46
Lecture 10 Big O O(1) 1:24
Lecture 11 Big O O(log n) 4:26
Lecture 12 Big O Different Terms for Input 2:6
Lecture 13 Big O Arrays 5:35
Lecture 14 Big O Wrap Up 4:30

Section 3 : Classes & Pointers

 		Lecture 15 Classes 5:52
Lecture 16 Pointers 4:36

Section 4 : Data Structures Linked Lists

 		Lecture 17 Linked List Intro 1:46
Lecture 18 LL Big O 6:13
Lecture 19 LL Under the Hood 2:39
Lecture 20 LL Constructor 7:12
Lecture 21 LL Push 5:42
Lecture 22 LL Reminder 1:13
Lecture 23 LL Pop - Intro 6:3
Lecture 24 LL Pop - Code 7:53
Lecture 25 LL Unshift 3:33
Lecture 26 LL Shift
Lecture 27 LL Get 3:46
Lecture 28 LL Set 4:42
Lecture 29 LL Insert 6:20
Lecture 30 LL Remove 4:56
Lecture 31 LL Reverse 5:53

Section 5 : Data Structures Doubly Linked Lists

 		Lecture 32 DLL Constructor 2:55
Lecture 33 DLL Push 3:55
Lecture 34 DLL Pop 7:7
Lecture 35 DLL Unshift 2:48
Lecture 36 DLL Shift 4:0
Lecture 37 DLL Get 4:29
Lecture 38 DLL Set 3:43
Lecture 39 DLL Insert 6:10
Lecture 40 DLL Remove 4:50

Section 6 : Data Structures Stacks & Queues

 		Lecture 41 Stack Intro 5:38
Lecture 42 Stack Constructor 3:0
Lecture 43 Stack Push 3:52
Lecture 44 Stack Pop 3:5
Lecture 45 Queue Intro 2:15
Lecture 46 Queue Constructor 1:59
Lecture 47 Queue Enqueue
Lecture 48 Queue Dequeue 3:25

Section 7 : Data Structures Trees

 		Lecture 49 Trees Intro & Terminology 4:22
Lecture 50 Binary Search Trees Example 2:30
Lecture 51 BST Big O 6:54
Lecture 52 BST Constructor 3:39
Lecture 53 BST Insert - Intro 6:5
Lecture 54 BST Insert - Code 9:43
Lecture 55 BST Contains 8:30

Section 8 : Data Structures Hash Tables

 		Lecture 56 Hash Table Intro 5:21
Lecture 57 HT Collisions 2:38
Lecture 58 HT Constructor 4:58
Lecture 59 HT Set 4:51
Lecture 60 HT Get 4:44
Lecture 61 HT Keys 3:19
Lecture 62 HT Big O 2:5
Lecture 63 HT Interview Question 5:29

Section 9 : Data Structures Graphs

 		Lecture 64 Graph Intro
Lecture 65 Graph Adjacency Matrix 3:17
Lecture 66 Graph Adjacency List 1:18
Lecture 67 Graph Big O 6:17
Lecture 68 Graph Add Vertex 3:10
Lecture 69 Graph Add Edge 3:14
Lecture 70 Graph Remove Edge 3:56
Lecture 71 Graph Remove Vertex 6:59

Section 10 : Algorithms Recursion

 		Lecture 72 Recursion Intro 6:29
Lecture 73 Call Stack 6:16
Lecture 74 Factorial 8:38

Section 11 : Algorithms Basic Sorts

 		Lecture 75 Bubble Sort Intro
Lecture 76 Bubble Sort Code 2:37
Lecture 77 Selection Sort Intro 2:55
Lecture 78 Selection Sort Code 4:58
Lecture 79 Insertion Sort Intro
Lecture 80 Insertion Sort Code 4:38
Lecture 81 Insertion Sort Big O 1:30

Section 12 : Algorithms Merge Sort

 		Lecture 82 Merge Sort Overview 1:45
Lecture 83 Merge Intro 1:37
Lecture 84 Merge Code 3:26
Lecture 85 Merge Sort Intro 1:19
Lecture 86 Merge Sort Code 3:39
Lecture 87 Merge Sort Big O 2:49

Section 13 : Algorithms Quick Sort

 		Lecture 88 Quick Sort Intro 2:32
Lecture 89 Pivot Intro 2:59
Lecture 90 Pivot Code 4:18
Lecture 91 Quick Sort Code 3:53
Lecture 92 Quick Sort Big O 3:36

Section 14 : Algorithms Tree Traversal

 		Lecture 93 Tree Traversal Intro 1:56
Lecture 94 BFS (Breadth First Search) Intro 3:38
Lecture 95 BFS Code 5:32
Lecture 96 DFS (Depth First Search) PreOrder - Intro 1:19
Lecture 97 DFS PreOrder - Code 6:31
Lecture 98 DFS PostOrder - Intro 2:13
Lecture 99 DFS PostOrder - Code 4:54
Lecture 100 DFS InOrder - Intro 1:46
Lecture 101 DFS InOrder - Code 4:20