Section 1 : Introduction
Lecture 1 Introduction 00:03:51 Duration
Lecture 2 Overview (Please Watch) 00:03:14 Duration
Lecture 3 Code Editor 00:04:04 Duration

Section 2 : Big O
Lecture 1 Big O Intro 00:02:58 Duration
Lecture 2 Big O Worst Case 00:01:29 Duration
Lecture 3 Big O O(n) 00:02:05 Duration
Lecture 4 Big O Drop Constants 00:01:38 Duration
Lecture 5 Big O O(n^2) 00:03:09 Duration
Lecture 6 Big O Drop Non-Dominants 00:01:46 Duration
Lecture 7 Big O O(1) 00:01:24 Duration
Lecture 8 Big O O(log n) 00:04:26 Duration
Lecture 9 Big O Different Terms for Input 00:02:06 Duration
Lecture 10 Big O Arrays 00:05:35 Duration
Lecture 11 Big O Wrap Up 00:04:30 Duration

Section 3 : Classes & Pointers
Lecture 1 Classes 00:05:52 Duration
Lecture 2 Pointers 00:04:36 Duration

Section 4 : Data Structures Linked Lists
Lecture 1 Linked List Intro 00:01:46 Duration
Lecture 2 LL Big O 00:06:13 Duration
Lecture 3 LL Under the Hood 00:02:39 Duration
Lecture 4 LL Constructor 00:07:12 Duration
Lecture 5 LL Push 00:05:42 Duration
Lecture 6 LL Reminder 00:01:13 Duration
Lecture 7 LL Pop - Intro 00:06:03 Duration
Lecture 8 LL Pop - Code 00:07:53 Duration
Lecture 9 LL Unshift 00:03:33 Duration
Lecture 10 LL Shift
Lecture 11 LL Get 00:03:46 Duration
Lecture 12 LL Set 00:04:42 Duration
Lecture 13 LL Insert 00:06:20 Duration
Lecture 14 LL Remove 00:04:56 Duration
Lecture 15 LL Reverse 00:05:53 Duration

Section 5 : Data Structures Doubly Linked Lists
Lecture 1 DLL Constructor 00:02:55 Duration
Lecture 2 DLL Push 00:03:55 Duration
Lecture 3 DLL Pop 00:07:07 Duration
Lecture 4 DLL Unshift 00:02:48 Duration
Lecture 5 DLL Shift 00:04:00 Duration
Lecture 6 DLL Get 00:04:29 Duration
Lecture 7 DLL Set 00:03:43 Duration
Lecture 8 DLL Insert 00:06:10 Duration
Lecture 9 DLL Remove 00:04:50 Duration

Section 6 : Data Structures Stacks & Queues
Lecture 1 Stack Intro 00:05:38 Duration
Lecture 2 Stack Constructor 00:03:00 Duration
Lecture 3 Stack Push 00:03:52 Duration
Lecture 4 Stack Pop 00:03:05 Duration
Lecture 5 Queue Intro 00:02:15 Duration
Lecture 6 Queue Constructor 00:01:59 Duration
Lecture 7 Queue Enqueue
Lecture 8 Queue Dequeue 00:03:25 Duration

Section 7 : Data Structures Trees
Lecture 1 Trees Intro & Terminology 00:04:22 Duration
Lecture 2 Binary Search Trees Example 00:02:30 Duration
Lecture 3 BST Big O 00:06:54 Duration
Lecture 4 BST Constructor 00:03:39 Duration
Lecture 5 BST Insert - Intro 00:06:05 Duration
Lecture 6 BST Insert - Code 00:09:43 Duration
Lecture 7 BST Contains 00:08:30 Duration

Section 8 : Data Structures Hash Tables
Lecture 1 Hash Table Intro 00:05:21 Duration
Lecture 2 HT Collisions 00:02:38 Duration
Lecture 3 HT Constructor 00:04:58 Duration
Lecture 4 HT Set 00:04:51 Duration
Lecture 5 HT Get 00:04:44 Duration
Lecture 6 HT Keys 00:03:19 Duration
Lecture 7 HT Big O 00:02:05 Duration
Lecture 8 HT Interview Question 00:05:29 Duration

Section 9 : Data Structures Graphs
Lecture 1 Graph Intro
Lecture 2 Graph Adjacency Matrix 00:03:17 Duration
Lecture 3 Graph Adjacency List 00:01:18 Duration
Lecture 4 Graph Big O 00:06:17 Duration
Lecture 5 Graph Add Vertex 00:03:10 Duration
Lecture 6 Graph Add Edge 00:03:14 Duration
Lecture 7 Graph Remove Edge 00:03:56 Duration
Lecture 8 Graph Remove Vertex 00:06:59 Duration

Section 10 : Algorithms Recursion
Lecture 1 Recursion Intro 00:06:29 Duration
Lecture 2 Call Stack 00:06:16 Duration
Lecture 3 Factorial 00:08:38 Duration

Section 11 : Algorithms Basic Sorts
Lecture 1 Bubble Sort Intro
Lecture 2 Bubble Sort Code 00:02:37 Duration
Lecture 3 Selection Sort Intro 00:02:55 Duration
Lecture 4 Selection Sort Code 00:04:58 Duration
Lecture 5 Insertion Sort Intro
Lecture 6 Insertion Sort Code 00:04:38 Duration
Lecture 7 Insertion Sort Big O 00:01:30 Duration

Section 12 : Algorithms Merge Sort
Lecture 1 Merge Sort Overview 00:01:45 Duration
Lecture 2 Merge Intro 00:01:37 Duration
Lecture 3 Merge Code 00:03:26 Duration
Lecture 4 Merge Sort Intro 00:01:19 Duration
Lecture 5 Merge Sort Code 00:03:39 Duration
Lecture 6 Merge Sort Big O 00:02:49 Duration

Section 13 : Algorithms Quick Sort
Lecture 1 Quick Sort Intro 00:02:32 Duration
Lecture 2 Pivot Intro 00:02:59 Duration
Lecture 3 Pivot Code 00:04:18 Duration
Lecture 4 Quick Sort Code 00:03:53 Duration
Lecture 5 Quick Sort Big O 00:03:36 Duration

Section 14 : Algorithms Tree Traversal
Lecture 1 Tree Traversal Intro 00:01:56 Duration
Lecture 2 BFS (Breadth First Search) Intro 00:03:38 Duration
Lecture 3 BFS Code 00:05:32 Duration
Lecture 4 DFS (Depth First Search) PreOrder - Intro 00:01:19 Duration
Lecture 5 DFS PreOrder - Code 00:06:31 Duration
Lecture 6 DFS PostOrder - Intro 00:02:13 Duration
Lecture 7 DFS PostOrder - Code 00:04:54 Duration
Lecture 8 DFS InOrder - Intro 00:01:46 Duration
Lecture 9 DFS InOrder - Code 00:04:20 Duration