Section 1 : Get Started Here!

Lecture 1 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM Pdf
Lecture 2 About Proctor Testing Pdf
Lecture 3 The All Important Coding Interview 4:11
Lecture 4 Getting Better at Coding Questions 5:45

Section 2 : A Touch of Setup

Lecture 5 Don't Skip This Video! 1:27
Lecture 6 Environment Setup 1:54
Lecture 7 Repo Test Setup 5:3
Lecture 8 Link to Github Repo Text

Section 3 : String Reversal

Lecture 9 First Question! Reverse String 2:56
Lecture 10 String Reversal, Solution #1 4:55
Lecture 11 String Reversal, Solution #2 5:58
Lecture 12 String Reversal, Solution #3 5:45
Lecture 13 Debugger Statements 9:27

Section 4 : Palindromes

Lecture 14 Palindromes 2:58
Lecture 15 Palindromes, Solution #1 2:48
Lecture 16 Palindromes, Alternate Solution 8:46

Section 5 : Integer Reversal

Lecture 17 Reversing an Int 6:55
Lecture 18 Reversing an Int Solution 6:49

Section 6 : MaxChars

Lecture 19 Max Chars Problem 5:23
Lecture 20 Max Chars Character Map 4:57
Lecture 21 Max Chars Solution 2:36
Lecture 22 Max Chars Solution Continued 4:7

Section 7 : The Classic FizzBuzz!

Lecture 23 FizzBuzz Problem Statement 5:26
Lecture 24 Solving FizzBuzz with Style 7:0

Section 8 : Array Chunking

Lecture 25 Array Chunk Problem Statement 3:3
Lecture 26 Chunk Solution #1 5:38
Lecture 27 More on Chunk 4:27
Lecture 28 Chunk Solution #2 4:37
Lecture 29 Even More on Chunk! 2:59

Section 9 : Anagrams

Lecture 30 What Are Anagrams 8:14
Lecture 31 Solving Anagrams 11:32
Lecture 32 Another Way to Tackle Anagrams

Section 10 : Sentence Capitalization

Lecture 33 Understanding Capitalization 3:54
Lecture 34 Capitalization Solution #1 5:9
Lecture 35 How Else Can We Capitalize 7:40

Section 11 : Printing Steps

Lecture 36 The Steps Question 4:21
Lecture 37 Steps Solution #1 6:28
Lecture 38 Steps Solution #1 Continued 4:58
Lecture 39 Step Up Your Steps Game 7:49
Lecture 40 More on Steps 15:48

Section 12 : Two Sided Steps - Pyramids

Lecture 41 Pyramids Vs Steps 4:49
Lecture 42 Pyramid Solution #1 9:54
Lecture 43 Pyramid Solution #2 8:39

Section 13 : Find The Vowels

Lecture 44 Get Your Vowels 1:48
Lecture 45 Finding Vowels 5:22
Lecture 46 Another Way to Find Vowels 3:42

Section 14 : Enter the Matrix Spiral

Lecture 47 General Matrix Spirals 3:18
Lecture 48 Spiral Solution 5:7
Lecture 49 More on Spiral 19:11

Section 15 : Runtime Complexity

Lecture 50 What is Runtime Complexity 5:28
Lecture 51 Determining Complexity 9:21
Lecture 52 More on Runtime Complexity 12:4

Section 16 : Runtime Complexity in Practice - Fibonacci

Lecture 53 The Fibonacci Series 2:37
Lecture 54 Fibonacci Series Iterative Solution 5:13
Lecture 55 Fibonacci Series Recursive Solution 10:2
Lecture 56 Memoi- 11:0
Lecture 57 I Believe Its Memoization! 11:38

Section 17 : The Queue

Lecture 58 What's a Data Structure 3:45
Lecture 59 The Queue Data Structure 6:42
Lecture 60 Implementing a Queue 6:33

Section 18 : Underwater Queue Weaving

Lecture 61 What's a Weave61 4:47
Lecture 62 How to Weave 5:9

Section 19 : Stack 'Em Up With Stacks

Lecture 63 Stack Data Structure 4:46
Lecture 64 Implementing a Stack

Section 20 : Two Become One

Lecture 65 Queue From Stack Question 3:27
Lecture 66 Creating a Queue From Stacks 7:10
Lecture 67 More on Queue From Stack 10:16

Section 21 : Linked Lists

Lecture 68 What's a Linked List 6:18
Lecture 69 Exercise Setup 5:28
Lecture 70 Node Implementation 6:31
Lecture 71 Linked List's Constructor 4:50
Lecture 72 Linked Lists's InsertFirst 5:10
Lecture 73 Solving Insert First 7:6
Lecture 74 Sizing a List 2:35
Lecture 75 Solve for Size 5:13
Lecture 76 Get Over Here, GetFirst! 0:55
Lecture 77 Building GetFirst 0:56
Lecture 78 Find Your Tail with GetLast 1:48
Lecture 79 GetLast Implementation 3:19
Lecture 80 Clear that List 1:16
Lecture 81 Clear Solution 1:56
Lecture 82 Where's My Head, RemoveFirst 1:36
Lecture 83 Building RemoveFirst 2:31
Lecture 84 Bye-Bye Tail with RemoveLast 5:4
Lecture 85 RemoveLast Implementation 6:16
Lecture 86 A New Tail to Tell with InsertLast 3:18
Lecture 87 Adding InsertLast 3:40
Lecture 88 Pick Em Out with GetAt 2:53
Lecture 89 GetAt Solution 6:19
Lecture 90 Remove Anything with RemoveAt 5:59
Lecture 91 RemoveAt Solution 9:44
Lecture 92 Insert Anywhere with InsertAt 4:0
Lecture 93 InsertAt Solution
Lecture 94 Code Reuse in Linked Lists 4:15
Lecture 95 List Traversal Through ForEach 2:26
Lecture 96 Note on Generators Text
Lecture 97 Brushup on Generators 20:9
Lecture 98 Linked Lists with Iterators 4:45

Section 22 : Find the Midpoint

Lecture 99 Midpoint of a Linked List 10:2
Lecture 100 Midpoint Solution 3:31

Section 23 : Circular Lists

Lecture 101 Detecting Linked Lists Loops
Lecture 102 Loop Solution 4:10

Section 24 : Step Back From the Tail

Lecture 103 From Last Question 6:17
Lecture 104 From Last Solution

Section 25 : Building a Tree

Lecture 105 Trees Overview 8:17
Lecture 106 Node Implementation 6:28
Lecture 107 More on Nodes 6:5
Lecture 108 Tree Implementation 4:18
Lecture 109 Traverse By Breadth 8:36
Lecture 110 Solving for Breadth-First Traversal 5:24
Lecture 111 Depth First Traversal 4:41
Lecture 112 Solving for Depth-First Traversal 2:38

Section 26 : Tree Width with Level Width

Lecture 113 Level Width Declaration 13:27
Lecture 114 Measuring Level Width 6:13

Section 27 : My Best Friend, Binary Search Trees

Lecture 115 What's a Binary Search Tree 7:5
Lecture 116 Binary Search Tree Implementation 4:43
Lecture 117 BST Insertion 4:38
Lecture 118 Do You Contain This 2:41
Lecture 119 Solving Contains 3:6

Section 28 : Validating a Binary Search Tree

Lecture 120 How to Validate a Binary Search Tree 5:27
Lecture 121 More on Validation 4:23
Lecture 122 Solution to Validation 12:49

Section 29 : Back to Javascript - Events

Lecture 123 What's an Eventing System 7:12
Lecture 124 A Tip on Events 2:10
Lecture 125 Events Solution 5:6

Section 30 : Building Twitter - A Design Question

Lecture 126 How to Build Twitter 15:29

Section 31 : Sorting With BubbleSort

Lecture 127 Sorting Algorithm Overview 5:5
Lecture 128 BubbleSort Implementation 7:11
Lecture 129 BubbleSort Solution 4:32

Section 32 : Sort By Selection

Lecture 130 How SelectionSort Works 5:24
Lecture 131 Selection Sort Solution 4:11

Section 33 : Ack, MergeSort!

Lecture 132 MergeSort Overview 6:20
Lecture 133 The Merge Function 7:26
Lecture 134 More on MergeSort 5:58
Lecture 135 I Don't Like Recursion, But Let's Do This Anyways 9:50