Section 1 : Get Started Here!
Lecture 1 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM
Lecture 2 About Proctor Testing
Lecture 3 The All Important Coding Interview 00:04:11 Duration
Lecture 4 Getting Better at Coding Questions 00:05:45 Duration

Section 2 : A Touch of Setup
Lecture 1 Don't Skip This Video! 00:01:27 Duration
Lecture 2 Environment Setup 00:01:54 Duration
Lecture 3 Repo Test Setup 00:05:03 Duration
Lecture 4 Link to Github Repo

Section 3 : String Reversal
Lecture 1 First Question! Reverse String 00:02:56 Duration
Lecture 2 String Reversal, Solution #1 00:04:55 Duration
Lecture 3 String Reversal, Solution #2 00:05:58 Duration
Lecture 4 String Reversal, Solution #3 00:05:45 Duration
Lecture 5 Debugger Statements 00:09:27 Duration

Section 4 : Palindromes
Lecture 1 Palindromes 00:02:58 Duration
Lecture 2 Palindromes, Solution #1 00:02:48 Duration
Lecture 3 Palindromes, Alternate Solution 00:08:46 Duration

Section 5 : Integer Reversal
Lecture 1 Reversing an Int 00:06:55 Duration
Lecture 2 Reversing an Int Solution 00:06:49 Duration

Section 6 : MaxChars
Lecture 1 Max Chars Problem 00:05:23 Duration
Lecture 2 Max Chars Character Map 00:04:57 Duration
Lecture 3 Max Chars Solution 00:02:36 Duration
Lecture 4 Max Chars Solution Continued 00:04:07 Duration

Section 7 : The Classic FizzBuzz!
Lecture 1 FizzBuzz Problem Statement 00:05:26 Duration
Lecture 2 Solving FizzBuzz with Style 00:07:00 Duration

Section 8 : Array Chunking
Lecture 1 Array Chunk Problem Statement 00:03:03 Duration
Lecture 2 Chunk Solution #1 00:05:38 Duration
Lecture 3 More on Chunk 00:04:27 Duration
Lecture 4 Chunk Solution #2 00:04:37 Duration
Lecture 5 Even More on Chunk! 00:02:59 Duration

Section 9 : Anagrams
Lecture 1 What Are Anagrams 00:08:14 Duration
Lecture 2 Solving Anagrams 00:11:32 Duration
Lecture 3 Another Way to Tackle Anagrams

Section 10 : Sentence Capitalization
Lecture 1 Understanding Capitalization 00:03:54 Duration
Lecture 2 Capitalization Solution #1 00:05:09 Duration
Lecture 3 How Else Can We Capitalize 00:07:40 Duration

Section 11 : Printing Steps
Lecture 1 The Steps Question 00:04:21 Duration
Lecture 2 Steps Solution #1 00:06:28 Duration
Lecture 3 Steps Solution #1 Continued 00:04:58 Duration
Lecture 4 Step Up Your Steps Game 00:07:49 Duration
Lecture 5 More on Steps 00:15:48 Duration

Section 12 : Two Sided Steps - Pyramids
Lecture 1 Pyramids Vs Steps 00:04:49 Duration
Lecture 2 Pyramid Solution #1 00:09:54 Duration
Lecture 3 Pyramid Solution #2 00:08:39 Duration

Section 13 : Find The Vowels
Lecture 1 Get Your Vowels 00:01:48 Duration
Lecture 2 Finding Vowels 00:05:22 Duration
Lecture 3 Another Way to Find Vowels 00:03:42 Duration

Section 14 : Enter the Matrix Spiral
Lecture 1 General Matrix Spirals 00:03:18 Duration
Lecture 2 Spiral Solution 00:05:07 Duration
Lecture 3 More on Spiral 00:19:11 Duration

Section 15 : Runtime Complexity
Lecture 1 What is Runtime Complexity 00:05:28 Duration
Lecture 2 Determining Complexity 00:09:21 Duration
Lecture 3 More on Runtime Complexity 00:12:04 Duration

Section 16 : Runtime Complexity in Practice - Fibonacci
Lecture 1 The Fibonacci Series 00:02:37 Duration
Lecture 2 Fibonacci Series Iterative Solution 00:05:13 Duration
Lecture 3 Fibonacci Series Recursive Solution 00:10:02 Duration
Lecture 4 Memoi- 00:11:00 Duration
Lecture 5 I Believe Its Memoization! 00:11:38 Duration

Section 17 : The Queue
Lecture 1 What's a Data Structure 00:03:45 Duration
Lecture 2 The Queue Data Structure 00:06:42 Duration
Lecture 3 Implementing a Queue 00:06:33 Duration

Section 18 : Underwater Queue Weaving
Lecture 1 What's a Weave61 00:04:47 Duration
Lecture 2 How to Weave 00:05:09 Duration

Section 19 : Stack 'Em Up With Stacks
Lecture 1 Stack Data Structure 00:04:46 Duration
Lecture 2 Implementing a Stack

Section 20 : Two Become One
Lecture 1 Queue From Stack Question 00:03:27 Duration
Lecture 2 Creating a Queue From Stacks 00:07:10 Duration
Lecture 3 More on Queue From Stack 00:10:16 Duration

Section 21 : Linked Lists
Lecture 1 What's a Linked List 00:06:18 Duration
Lecture 2 Exercise Setup 00:05:28 Duration
Lecture 3 Node Implementation 00:06:31 Duration
Lecture 4 Linked List's Constructor 00:04:50 Duration
Lecture 5 Linked Lists's InsertFirst 00:05:10 Duration
Lecture 6 Solving Insert First 00:07:06 Duration
Lecture 7 Sizing a List 00:02:35 Duration
Lecture 8 Solve for Size 00:05:13 Duration
Lecture 9 Get Over Here, GetFirst! 00:00:55 Duration
Lecture 10 Building GetFirst 00:00:56 Duration
Lecture 11 Find Your Tail with GetLast 00:01:48 Duration
Lecture 12 GetLast Implementation 00:03:19 Duration
Lecture 13 Clear that List 00:01:16 Duration
Lecture 14 Clear Solution 00:01:56 Duration
Lecture 15 Where's My Head, RemoveFirst 00:01:36 Duration
Lecture 16 Building RemoveFirst 00:02:31 Duration
Lecture 17 Bye-Bye Tail with RemoveLast 00:05:04 Duration
Lecture 18 RemoveLast Implementation 00:06:16 Duration
Lecture 19 A New Tail to Tell with InsertLast 00:03:18 Duration
Lecture 20 Adding InsertLast 00:03:40 Duration
Lecture 21 Pick Em Out with GetAt 00:02:53 Duration
Lecture 22 GetAt Solution 00:06:19 Duration
Lecture 23 Remove Anything with RemoveAt 00:05:59 Duration
Lecture 24 RemoveAt Solution 00:09:44 Duration
Lecture 25 Insert Anywhere with InsertAt 00:04:00 Duration
Lecture 26 InsertAt Solution
Lecture 27 Code Reuse in Linked Lists 00:04:15 Duration
Lecture 28 List Traversal Through ForEach 00:02:26 Duration
Lecture 29 Note on Generators
Lecture 30 Brushup on Generators 00:20:09 Duration
Lecture 31 Linked Lists with Iterators 00:04:45 Duration

Section 22 : Find the Midpoint
Lecture 1 Midpoint of a Linked List 00:10:02 Duration
Lecture 2 Midpoint Solution 00:03:31 Duration

Section 23 : Circular Lists
Lecture 1 Detecting Linked Lists Loops
Lecture 2 Loop Solution 00:04:10 Duration

Section 24 : Step Back From the Tail
Lecture 1 From Last Question 00:06:17 Duration
Lecture 2 From Last Solution

Section 25 : Building a Tree
Lecture 1 Trees Overview 00:08:17 Duration
Lecture 2 Node Implementation 00:06:28 Duration
Lecture 3 More on Nodes 00:06:05 Duration
Lecture 4 Tree Implementation 00:04:18 Duration
Lecture 5 Traverse By Breadth 00:08:36 Duration
Lecture 6 Solving for Breadth-First Traversal 00:05:24 Duration
Lecture 7 Depth First Traversal 00:04:41 Duration
Lecture 8 Solving for Depth-First Traversal 00:02:38 Duration

Section 26 : Tree Width with Level Width
Lecture 1 Level Width Declaration 00:13:27 Duration
Lecture 2 Measuring Level Width 00:06:13 Duration

Section 27 : My Best Friend, Binary Search Trees
Lecture 1 What's a Binary Search Tree 00:07:05 Duration
Lecture 2 Binary Search Tree Implementation 00:04:43 Duration
Lecture 3 BST Insertion 00:04:38 Duration
Lecture 4 Do You Contain This 00:02:41 Duration
Lecture 5 Solving Contains 00:03:06 Duration

Section 28 : Validating a Binary Search Tree
Lecture 1 How to Validate a Binary Search Tree 00:05:27 Duration
Lecture 2 More on Validation 00:04:23 Duration
Lecture 3 Solution to Validation 00:12:49 Duration

Section 29 : Back to Javascript - Events
Lecture 1 What's an Eventing System 00:07:12 Duration
Lecture 2 A Tip on Events 00:02:10 Duration
Lecture 3 Events Solution 00:05:06 Duration

Section 30 : Building Twitter - A Design Question
Lecture 1 How to Build Twitter 00:15:29 Duration

Section 31 : Sorting With BubbleSort
Lecture 1 Sorting Algorithm Overview 00:05:05 Duration
Lecture 2 BubbleSort Implementation 00:07:11 Duration
Lecture 3 BubbleSort Solution 00:04:32 Duration

Section 32 : Sort By Selection
Lecture 1 How SelectionSort Works 00:05:24 Duration
Lecture 2 Selection Sort Solution 00:04:11 Duration

Section 33 : Ack, MergeSort!
Lecture 1 MergeSort Overview 00:06:20 Duration
Lecture 2 The Merge Function 00:07:26 Duration
Lecture 3 More on MergeSort 00:05:58 Duration
Lecture 4 I Don't Like Recursion, But Let's Do This Anyways 00:09:50 Duration