Section 1 : Getting More Interviews
Lecture 1 Section Overview 00:05:20 Duration
Lecture 2 Resume 00:05:09 Duration
Lecture 3 Exercise Resume Walkthrough 00:16:34 Duration
Lecture 4 Resume Review 00:02:37 Duration
Lecture 5 What If I Don't Have Enough Experience 00:15:03 Duration
Lecture 6 LinkedIn 00:08:23 Duration
Lecture 7 Portfolio 00:03:23 Duration
Lecture 8 Email 00:08:24 Duration
Lecture 9 Where To Find Jobs 00:06:03 Duration
Lecture 10 When Should You Start Applying 00:03:34 Duration
Lecture 11 Section Summary 00:02:17 Duration

Section 2 : Big O
Lecture 1 Setting Up Your Environment 00:02:54 Duration
Lecture 2 Section Overview 00:02:10 Duration
Lecture 3 What Is Good Code 00:06:57 Duration
Lecture 4 Big O and Scalability 00:11:09 Duration
Lecture 5 O(n) 00:05:39 Duration
Lecture 6 O(1) 00:06:10 Duration
Lecture 7 Solution Big O Calculation 00:05:55 Duration
Lecture 8 Solution Big O Calculation 2 00:02:30 Duration
Lecture 9 Simplifying Big O 00:01:51 Duration
Lecture 10 Big O Rule 1 00:04:29 Duration
Lecture 11 Big O Rule 2 00:06:37 Duration
Lecture 12 Big O Rule 3 00:03:14 Duration
Lecture 13 O(n^2) 00:07:14 Duration
Lecture 14 Big O Rule 4 00:06:47 Duration
Lecture 15 Big O Cheat Sheet 00:03:19 Duration
Lecture 16 What Does This All Mean 00:05:32 Duration
Lecture 17 O(n!) 00:01:18 Duration
Lecture 18 3 Pillars Of Programming 00:03:32 Duration
Lecture 19 Space Complexity 00:02:23 Duration
Lecture 20 Exercise Space Complexity 00:06:24 Duration
Lecture 21 Exercise Twitter 00:07:14 Duration
Lecture 22 Optional Javascript Loops 00:03:27 Duration
Lecture 23 Section Summary 00:04:44 Duration

Section 3 : How To Solve Coding Problems
Lecture 1 Section Overview 00:04:48 Duration
Lecture 2 What Are Companies Looking For 00:03:06 Duration
Lecture 3 What We Need For Coding Interviews 00:03:27 Duration
Lecture 4 Exercise Google Interview 00:00:26 Duration
Lecture 5 Exercise Interview Question 00:20:33 Duration
Lecture 6 Exercise Interview Question 2 00:22:59 Duration
Lecture 7 Review Google Interview 00:01:30 Duration
Lecture 8 Section Summary 00:03:36 Duration

Section 4 : Data Structures Introduction
Lecture 1 Section Overview 00:01:42 Duration
Lecture 2 What Is A Data Structure 00:05:53 Duration
Lecture 3 How Computers Store Data 00:12:34 Duration
Lecture 4 Data Structures In Different Languages 00:03:28 Duration
Lecture 5 Operations On Data Structures 00:03:05 Duration

Section 5 : Data Structures Arrays
Lecture 1 Arrays Introduction 00:13:38 Duration
Lecture 2 Static vs Dynamic Arrays 00:06:41 Duration
Lecture 3 Optional Classes In Javascript 00:24:52 Duration
Lecture 4 Implementing An Array 00:17:19 Duration
Lecture 5 Strings and Arrays 00:01:05 Duration
Lecture 6 Exercise Reverse A String 00:01:30 Duration
Lecture 7 Solution Reverse A String 00:10:31 Duration
Lecture 8 Exercise Merge Sorted Arrays 00:00:44 Duration
Lecture 9 Solution Merge Sorted Arrays 00:14:12 Duration
Lecture 10 Arrays Review 00:03:29 Duration

Section 6 : Data Structures Hash Tables
Lecture 1 Hash Tables Introduction 00:03:54 Duration
Lecture 2 Hash Function 00:05:56 Duration
Lecture 3 Hash Collisions 00:09:44 Duration
Lecture 4 Hash Tables In Different Languages 00:03:31 Duration
Lecture 5 Exercise Implement A Hash Table 00:03:45 Duration
Lecture 6 Solution Implement A Hash Table 00:17:25 Duration
Lecture 7 keys() 00:06:12 Duration
Lecture 8 Hash Tables VS Arrays 00:02:01 Duration
Lecture 9 Exercise First Recurring Character 00:01:18 Duration
Lecture 10 Solution First Recurring Character 00:16:11 Duration
Lecture 11 Hash Tables Review 00:06:09 Duration

Section 7 : Data Structures Linked Lists
Lecture 1 Linked Lists Introduction 00:02:27 Duration
Lecture 2 What Is A Linked List 00:04:37 Duration
Lecture 3 Exercise Why Linked Lists 00:02:05 Duration
Lecture 4 Solution Why Linked Lists 00:05:36 Duration
Lecture 5 What Is A Pointer 00:05:45 Duration
Lecture 6 Our First Linked List 00:08:33 Duration
Lecture 7 Solution append() 00:05:20 Duration
Lecture 8 Solution prepend() 00:02:28 Duration
Lecture 9 Node Class 00:02:41 Duration
Lecture 10 insert() 00:05:13 Duration
Lecture 11 Solution insert() 00:13:08 Duration
Lecture 12 Solution remove() 00:05:21 Duration
Lecture 13 Doubly Linked Lists 00:03:18 Duration
Lecture 14 Solution Doubly Linked Lists 00:08:51 Duration
Lecture 15 Singly VS Doubly Linked Lists
Lecture 16 Exercise reverse() 00:01:31 Duration
Lecture 17 Solution reverse() 00:07:39 Duration
Lecture 18 Linked Lists Review 00:05:08 Duration

Section 8 : Data Structures Stacks + Queues
Lecture 1 Stacks + Queues Introduction 00:02:45 Duration
Lecture 2 Stacks 00:02:45 Duration
Lecture 3 Queues 00:03:31 Duration
Lecture 4 Exercise Stacks VS Queues 00:03:06 Duration
Lecture 5 Solution Stacks VS Queues
Lecture 6 Optional How Javascript Works 00:24:12 Duration
Lecture 7 Exercise Stack Implementation (Linked Lists) 00:02:17 Duration
Lecture 8 Solution Stack Implementation (Linked Lists) 00:08:58 Duration
Lecture 9 Exercise Stack Implementation (Array) 00:00:53 Duration
Lecture 10 Solution Stack Implementation (Array) 00:03:56 Duration
Lecture 11 Exercise Queue Implementation 00:01:48 Duration
Lecture 12 Solution Queue Implementation 00:07:51 Duration
Lecture 13 Queues Using Stacks 00:02:05 Duration
Lecture 14 Stacks + Queues Review 00:02:19 Duration

Section 9 : Data Structures Trees
Lecture 1 Trees Introduction 00:06:06 Duration
Lecture 2 Binary Trees 00:05:45 Duration
Lecture 3 O(log n) 00:07:00 Duration
Lecture 4 Binary Search Trees 00:06:12 Duration
Lecture 5 Balanced VS Unbalanced BST 00:03:39 Duration
Lecture 6 BST Pros and Cons 00:02:27 Duration
Lecture 7 Exercise Binary Search Tree 00:03:57 Duration
Lecture 8 Solution insert() 00:10:11 Duration
Lecture 9 Solution lookup() 00:04:55 Duration
Lecture 10 Bonus Exercise remove() 00:02:28 Duration
Lecture 11 Solution remove() 00:07:41 Duration
Lecture 12 AVL Trees + Red Black Trees 00:02:56 Duration
Lecture 13 Binary Heaps 00:05:36 Duration
Lecture 14 Quick Note on Heaps 00:01:08 Duration
Lecture 15 Priority Queue 00:05:28 Duration
Lecture 16 Trie 00:03:17 Duration
Lecture 17 Tree Review 00:00:52 Duration

Section 10 : Data Structures Graphs
Lecture 1 Graphs Introduction 00:02:14 Duration
Lecture 2 Types Of Graphs 00:03:32 Duration
Lecture 3 Exercise Guess The Graph 00:02:45 Duration
Lecture 4 Graph Data 00:05:59 Duration
Lecture 5 Exercise Graph Implementation 00:04:06 Duration
Lecture 6 Solution Graph Implementation 00:04:51 Duration
Lecture 7 Graphs Review 00:02:05 Duration
Lecture 8 Data Structures Review 00:01:52 Duration
Lecture 9 What Else Is Coming Up 00:01:53 Duration

Section 11 : Algorithms Recursion
Lecture 1 Introduction to Algorithms 00:03:36 Duration
Lecture 2 Recursion Introduction 00:05:37 Duration
Lecture 3 Stack Overflow 00:06:17 Duration
Lecture 4 Anatomy Of Recursion
Lecture 5 Exercise Factorial 00:03:25 Duration
Lecture 6 Solution Factorial 00:06:20 Duration
Lecture 7 Exercise Fibonacci 00:01:59 Duration
Lecture 8 Solution Fibonacci 00:11:22 Duration
Lecture 9 Recursive VS Iterative 00:04:16 Duration
Lecture 10 When To Use Recursion 00:03:54 Duration
Lecture 11 Recursion Review 00:02:47 Duration

Section 12 : Algorithms Sorting
Lecture 1 Sorting Introduction 00:06:46 Duration
Lecture 2 The Issue With sort() 00:06:51 Duration
Lecture 3 Sorting Algorithms 00:03:38 Duration
Lecture 4 Bubble Sort 00:03:46 Duration
Lecture 5 Solution Bubble Sort 00:05:07 Duration
Lecture 6 Selection Sort 00:02:39 Duration
Lecture 7 Solution Selection Sort 00:02:23 Duration
Lecture 8 Dancing Algorithms 00:01:36 Duration
Lecture 9 Insertion Sort 00:02:38 Duration
Lecture 10 Solution Insertion Sort 00:02:07 Duration
Lecture 11 Merge Sort and O(n log n) 00:08:59 Duration
Lecture 12 Solution Merge Sort 00:08:59 Duration
Lecture 13 Quick Sort 00:07:40 Duration
Lecture 14 Which Sort Is Best 00:04:41 Duration
Lecture 15 Radix Sort + Counting Sort
Lecture 16 Exercise Sorting Interview 00:01:27 Duration
Lecture 17 Solution Sorting Interview 00:07:07 Duration
Lecture 18 Sorting In Your Language 00:01:27 Duration
Lecture 19 Sorting Review 00:02:53 Duration

Section 13 : Algorithms Searching + BFS + DFS
Lecture 1 Searching + Traversal Introduction 00:01:19 Duration
Lecture 2 Linear Search 00:03:37 Duration
Lecture 3 Binary Search 00:06:05 Duration
Lecture 4 Graph + Tree Traversals 00:03:56 Duration
Lecture 5 BFS Introduction 00:02:45 Duration
Lecture 6 DFS Introduction 00:03:23 Duration
Lecture 7 BFS vs DFS 00:03:21 Duration
Lecture 8 Exercise BFS vs DFS 00:00:44 Duration
Lecture 9 Solution BFS vs DFS 00:03:16 Duration
Lecture 10 breadthFirstSearch() 00:09:15 Duration
Lecture 11 breadthFirstSearchRecursive() 00:05:34 Duration
Lecture 12 PreOrder, InOrder, PostOrder 00:05:21 Duration
Lecture 13 depthFirstSearch() 00:12:03 Duration
Lecture 14 Graph Traversals 00:03:53 Duration
Lecture 15 BFS in Graphs 00:02:07 Duration
Lecture 16 DFS in Graphs 00:02:50 Duration
Lecture 17 Dijkstra + Bellman-Ford Algorithms 00:05:12 Duration
Lecture 18 Searching + Traversal Review 00:04:22 Duration

Section 14 : Algorithms Dynamic Programming
Lecture 1 Dynamic Programming Introduction 00:01:36 Duration
Lecture 2 Memoization 1 00:07:47 Duration
Lecture 3 Memoization 2 00:03:56 Duration
Lecture 4 Fibonacci and Dynamic Programming 00:05:33 Duration
Lecture 5 Dynamic Programming 00:05:48 Duration
Lecture 6 Implementing Dynamic Programming 00:09:12 Duration
Lecture 7 Dynamic Programming Review 00:04:45 Duration

Section 15 : Non Technical Interviews
Lecture 1 Section Overview 00:02:24 Duration
Lecture 2 During The Interview 00:09:04 Duration
Lecture 3 Tell Me About Yourself 00:05:30 Duration
Lecture 4 Why Us 00:05:07 Duration
Lecture 5 Tell Me About A Problem You Have Solved 00:05:10 Duration
Lecture 6 What Is Your Biggest Weakness 00:02:19 Duration
Lecture 7 Any Questions For Us 00:03:24 Duration
Lecture 8 Secret Weapon 00:08:12 Duration
Lecture 9 After The Interview 00:05:24 Duration
Lecture 10 Section Summary 00:03:56 Duration

Section 16 : Offer + Negotiation
Lecture 1 Section Overview 00:01:55 Duration
Lecture 2 Handling Rejection 00:04:08 Duration
Lecture 3 Negotiation 101 00:09:40 Duration
Lecture 4 Handling An Offer 00:09:03 Duration
Lecture 5 Handling Multiple Offers 00:07:29 Duration
Lecture 6 Getting A Raise 00:07:41 Duration
Lecture 7 Section Summary 00:02:10 Duration

Section 17 : Thank You
Lecture 1 Thank You 00:00:37 Duration

Section 18 : Extras Google, Amazon, Facebook Interview Questions
Lecture 1 Coding Problems 00:01:06 Duration

Section 19 : Contributing To Open Source To Gain Experience
Lecture 1 Contributing To Open Source 00:10:49 Duration
Lecture 2 Contributing To Open Source 2 00:09:43 Duration

Section 20 : Bonus Extra Bits
Lecture 1 From JTS Learn to Learn 00:02:00 Duration
Lecture 2 From JTS Start With Why
Lecture 3 How To Use Leetcode 00:02:28 Duration