Introduction to Data Structures & Important Concepts
Linked Lists
-
What is a Linked List? (2:35)
-
Linked List and "Node"Constructor Functions (6:34)
-
Add To Head - part 1 (3:19)
-
Add To Head - part 2 (6:56)
-
Using Add To Head (5:06)
-
Add To Tail (2:48)
-
Testing Add To Tail and Add To Head (4:17)
-
Remove Head (5:21)
-
Remove Tail (4:05)
-
Search Method (6:28)
-
Testing Search (2:50)
-
Linked List - Independent Exercise (1:09)
-
Linked List - Exercise Review (5:10)
-
Big O Notation and Calculating the Runtime of a Function (8:55)
-
Big O Notation & Runtime Source Code
-
Linked List Wrap-Up (4:28)
-
Linked List Source Code
Binary Search Trees
-
What is a Binary Search Tree? (5:51)
-
Recursion - part 1 (4:20)
-
Recursion part 2 and the Call Stack (5:18)
-
Insert Method (8:08)
-
Testing Insert (3:02)
-
Contains Method (3:53)
-
Testing Contains (2:04)
-
Depth First Traversal - In-Order (7:14)
-
Testing Depth First Traversal In-Order (1:53)
-
Refactoring Depth First Traversal Method (2:33)
-
Depth First Traversal - Pre-Order (2:46)
-
Testing Depth First Traversal Pre-Order (1:22)
-
Depth First Traversal - Post-Order (3:39)
-
Breadth First Traversal - part 1 (3:37)
-
Breadth First Traversal - part 2 (6:15)
-
Testing Breadth First Traversal (2:34)
-
Binary Search Tree - Independent Exercise (0:49)
-
Binary Search Tree - Exercise Review (3:08)
-
Binary Search Tree Wrap-Up (3:26)
-
Binary Search Tree Source Code
Hash Tables
-
What is a Hash Table? (6:43)
-
Hash Table and Hash Node Constructor Functions (4:44)
-
CharCodeAt Method and Modulus Operator (4:20)
-
Hash Method (4:46)
-
Insert Method (5:34)
-
Testing Insert Method (3:19)
-
Refactoring Insert Method (5:46)
-
Testing Refactored Insert Method (2:24)
-
Get Method (4:54)
-
Testing Get Method (1:44)
-
Hash Table - Independent Exercise (0:49)
-
Hash Table - Exercise Review (4:55)
-
Hash Table Wrap-Up (2:06)
-
Hash Table Source Code
Introduction To Algorithms
Fizz Buzz
Harmless Ransom Note
Is Palindrome
Caesar Cipher
Reverse Words
Reverse Array In Place
Mean Median Mode
Binary Search
Fibonacci
Memoized Fibonacci
Sieve of Eratosthenes
Bubble Sort
Merge Sort
Max Stock Profit
Introduction To Interview Questions
Triple Add Function
Working With IIFEs
Button 5
"this" Keyword
Hoisting In JavaScript
Scope and "self"
Equals vs Strict Equals
Log Number Function
Use Strict
Curry Function
Counter Function
Logging X and Y
"call" and "apply" Methods
Determine "list2"
Singly or Doubly Invoked Function
JSON Data
Order Logged Out
Making an Object
Type of Data Types
Bind Method
Two Objects
Array Constructor
IndexOf Obscurity
Equivalent Numbers
Decoding Objects and Strings
Manipulating Strings and Arrays
Peculiar Object Properties
X and Y
Withdraw From Account
