# Udemy - Master the Coding Interview; Data Structures Algorithms #Last updated 12-2019

#### Category: Technical

Posted on 2019-12-17, by phaelx.

Description

Date: 12/2019
Author: Andrei Neagoie

Size: 12 GB
Format: MP4
What you'll learn
*Ace coding interviews given by some of the top tech companies
*Become more confident and prepared for your next coding interview
*Learn, implement, and use different Data Structures
*Learn, implement and use different Algorithms
*Get more interviews
*Professionally handle offers and negotiate raises
*Become a better developer by mastering computer science fundamentals

Course content

Introduction
How To Succeed In This Course
Exercise: Meet The Community!

Getting More Interviews
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary

Big O
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary

How To Solve Coding Problems
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary

Data Structures: Introduction
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures

Data Structures: Arrays
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review

Data Structures: Hash Tables
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review

How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()

Data Structures: Stacks + Queues
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review

Data Structures: Trees
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review

Data Structures: Graphs
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?

Algorithms: Recursion
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review

Algorithms: Sorting
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review
Sorting Introduction
The Issue With sort()
Sorting Algorithms
Bubble Sort
Exercise: Bubble Sort
Solution: Bubble Sort
Selection Sort
Exercise: Selection Sort
Solution: Selection Sort
Dancing Algorithms
Insertion Sort
Exercise: Insertion Sort
Solution: Insertion Sort
Merge Sort and O(n log n)
Exercise: Merge Sort
Solution: Merge Sort
Stable VS Unstable Algorithms
Quick Sort
Optional Exercise: Quick Sort
Which Sort Is Best?
Resources: Heap Sort
Resources: Radix Sort + Counting Sort
Exercise: Sorting Interview
Solution: Sorting Interview
Sorting Review

Algorithms: Searching + BFS + DFS
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review
Sorting Introduction
The Issue With sort()
Sorting Algorithms
Bubble Sort
Exercise: Bubble Sort
Solution: Bubble Sort
Selection Sort
Exercise: Selection Sort
Solution: Selection Sort
Dancing Algorithms
Insertion Sort
Exercise: Insertion Sort
Solution: Insertion Sort
Merge Sort and O(n log n)
Exercise: Merge Sort
Solution: Merge Sort
Stable VS Unstable Algorithms
Quick Sort
Optional Exercise: Quick Sort
Which Sort Is Best?
Resources: Heap Sort
Resources: Radix Sort + Counting Sort
Exercise: Sorting Interview
Solution: Sorting Interview
Sorting Review
Searching + Traversal Introduction
Linear Search
Binary Search
Graph + Tree Traversals
BFS Introduction
DFS Introduction
BFS vs DFS
Resources: BFS vs DFS
Exercise: BFS vs DFS
Solution: BFS vs DFS
PreOrder, InOrder, PostOrder
depthFirstSearch()
Optional Exercise: Validate A BST
Graph Traversals
BFS in Graphs
DFS in Graphs
Dijkstra + Bellman-Ford Algorithms
Searching + Traversal Review

Algorithms: Dynamic Programming
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review
Sorting Introduction
The Issue With sort()
Sorting Algorithms
Bubble Sort
Exercise: Bubble Sort
Solution: Bubble Sort
Selection Sort
Exercise: Selection Sort
Solution: Selection Sort
Dancing Algorithms
Insertion Sort
Exercise: Insertion Sort
Solution: Insertion Sort
Merge Sort and O(n log n)
Exercise: Merge Sort
Solution: Merge Sort
Stable VS Unstable Algorithms
Quick Sort
Optional Exercise: Quick Sort
Which Sort Is Best?
Resources: Heap Sort
Resources: Radix Sort + Counting Sort
Exercise: Sorting Interview
Solution: Sorting Interview
Sorting Review
Searching + Traversal Introduction
Linear Search
Binary Search
Graph + Tree Traversals
BFS Introduction
DFS Introduction
BFS vs DFS
Resources: BFS vs DFS
Exercise: BFS vs DFS
Solution: BFS vs DFS
PreOrder, InOrder, PostOrder
depthFirstSearch()
Optional Exercise: Validate A BST
Graph Traversals
BFS in Graphs
DFS in Graphs
Dijkstra + Bellman-Ford Algorithms
Searching + Traversal Review
Dynamic Programming Introduction
Memoization 1
Memoization 2
Fibonacci and Dynamic Programming
Dynamic Programming
Implementing Dynamic Programming
Interview Questions: Dynamic Programming
Dynamic Programming Review

Non Technical Interviews
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review
Sorting Introduction
The Issue With sort()
Sorting Algorithms
Bubble Sort
Exercise: Bubble Sort
Solution: Bubble Sort
Selection Sort
Exercise: Selection Sort
Solution: Selection Sort
Dancing Algorithms
Insertion Sort
Exercise: Insertion Sort
Solution: Insertion Sort
Merge Sort and O(n log n)
Exercise: Merge Sort
Solution: Merge Sort
Stable VS Unstable Algorithms
Quick Sort
Optional Exercise: Quick Sort
Which Sort Is Best?
Resources: Heap Sort
Resources: Radix Sort + Counting Sort
Exercise: Sorting Interview
Solution: Sorting Interview
Sorting Review
Searching + Traversal Introduction
Linear Search
Binary Search
Graph + Tree Traversals
BFS Introduction
DFS Introduction
BFS vs DFS
Resources: BFS vs DFS
Exercise: BFS vs DFS
Solution: BFS vs DFS
PreOrder, InOrder, PostOrder
depthFirstSearch()
Optional Exercise: Validate A BST
Graph Traversals
BFS in Graphs
DFS in Graphs
Dijkstra + Bellman-Ford Algorithms
Searching + Traversal Review
Dynamic Programming Introduction
Memoization 1
Memoization 2
Fibonacci and Dynamic Programming
Dynamic Programming
Implementing Dynamic Programming
Interview Questions: Dynamic Programming
Dynamic Programming Review
Section Overview
During The Interview
Exercise: Hero Stories
Why Us?
Tell Me About A Problem You Have Solved
Exercise: Past Projects
Any Questions For Us?
Resources: Questions To Ask A Company
Secret Weapon
After The Interview
Section Summary

Offer + Negotiation
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review
Sorting Introduction
The Issue With sort()
Sorting Algorithms
Bubble Sort
Exercise: Bubble Sort
Solution: Bubble Sort
Selection Sort
Exercise: Selection Sort
Solution: Selection Sort
Dancing Algorithms
Insertion Sort
Exercise: Insertion Sort
Solution: Insertion Sort
Merge Sort and O(n log n)
Exercise: Merge Sort
Solution: Merge Sort
Stable VS Unstable Algorithms
Quick Sort
Optional Exercise: Quick Sort
Which Sort Is Best?
Resources: Heap Sort
Resources: Radix Sort + Counting Sort
Exercise: Sorting Interview
Solution: Sorting Interview
Sorting Review
Searching + Traversal Introduction
Linear Search
Binary Search
Graph + Tree Traversals
BFS Introduction
DFS Introduction
BFS vs DFS
Resources: BFS vs DFS
Exercise: BFS vs DFS
Solution: BFS vs DFS
PreOrder, InOrder, PostOrder
depthFirstSearch()
Optional Exercise: Validate A BST
Graph Traversals
BFS in Graphs
DFS in Graphs
Dijkstra + Bellman-Ford Algorithms
Searching + Traversal Review
Dynamic Programming Introduction
Memoization 1
Memoization 2
Fibonacci and Dynamic Programming
Dynamic Programming
Implementing Dynamic Programming
Interview Questions: Dynamic Programming
Dynamic Programming Review
Section Overview
During The Interview
Exercise: Hero Stories
Why Us?
Tell Me About A Problem You Have Solved
Exercise: Past Projects
Any Questions For Us?
Resources: Questions To Ask A Company
Secret Weapon
After The Interview
Section Summary
Section Overview
Handling Rejection
Negotiation 101
Handling An Offer
Handling Multiple Offers
Getting A Raise
Exercise: Negotiation Master
Section Summary

Thank You
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review
Sorting Introduction
The Issue With sort()
Sorting Algorithms
Bubble Sort
Exercise: Bubble Sort
Solution: Bubble Sort
Selection Sort
Exercise: Selection Sort
Solution: Selection Sort
Dancing Algorithms
Insertion Sort
Exercise: Insertion Sort
Solution: Insertion Sort
Merge Sort and O(n log n)
Exercise: Merge Sort
Solution: Merge Sort
Stable VS Unstable Algorithms
Quick Sort
Optional Exercise: Quick Sort
Which Sort Is Best?
Resources: Heap Sort
Resources: Radix Sort + Counting Sort
Exercise: Sorting Interview
Solution: Sorting Interview
Sorting Review
Searching + Traversal Introduction
Linear Search
Binary Search
Graph + Tree Traversals
BFS Introduction
DFS Introduction
BFS vs DFS
Resources: BFS vs DFS
Exercise: BFS vs DFS
Solution: BFS vs DFS
PreOrder, InOrder, PostOrder
depthFirstSearch()
Optional Exercise: Validate A BST
Graph Traversals
BFS in Graphs
DFS in Graphs
Dijkstra + Bellman-Ford Algorithms
Searching + Traversal Review
Dynamic Programming Introduction
Memoization 1
Memoization 2
Fibonacci and Dynamic Programming
Dynamic Programming
Implementing Dynamic Programming
Interview Questions: Dynamic Programming
Dynamic Programming Review
Section Overview
During The Interview
Exercise: Hero Stories
Why Us?
Tell Me About A Problem You Have Solved
Exercise: Past Projects
Any Questions For Us?
Resources: Questions To Ask A Company
Secret Weapon
After The Interview
Section Summary
Section Overview
Handling Rejection
Negotiation 101
Handling An Offer
Handling Multiple Offers
Getting A Raise
Exercise: Negotiation Master
Section Summary
Become an Alumni
Thank You.
What You Can Do Now

How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review
Sorting Introduction
The Issue With sort()
Sorting Algorithms
Bubble Sort
Exercise: Bubble Sort
Solution: Bubble Sort
Selection Sort
Exercise: Selection Sort
Solution: Selection Sort
Dancing Algorithms
Insertion Sort
Exercise: Insertion Sort
Solution: Insertion Sort
Merge Sort and O(n log n)
Exercise: Merge Sort
Solution: Merge Sort
Stable VS Unstable Algorithms
Quick Sort
Optional Exercise: Quick Sort
Which Sort Is Best?
Resources: Heap Sort
Resources: Radix Sort + Counting Sort
Exercise: Sorting Interview
Solution: Sorting Interview
Sorting Review
Searching + Traversal Introduction
Linear Search
Binary Search
Graph + Tree Traversals
BFS Introduction
DFS Introduction
BFS vs DFS
Resources: BFS vs DFS
Exercise: BFS vs DFS
Solution: BFS vs DFS
PreOrder, InOrder, PostOrder
depthFirstSearch()
Optional Exercise: Validate A BST
Graph Traversals
BFS in Graphs
DFS in Graphs
Dijkstra + Bellman-Ford Algorithms
Searching + Traversal Review
Dynamic Programming Introduction
Memoization 1
Memoization 2
Fibonacci and Dynamic Programming
Dynamic Programming
Implementing Dynamic Programming
Interview Questions: Dynamic Programming
Dynamic Programming Review
Section Overview
During The Interview
Exercise: Hero Stories
Why Us?
Tell Me About A Problem You Have Solved
Exercise: Past Projects
Any Questions For Us?
Resources: Questions To Ask A Company
Secret Weapon
After The Interview
Section Summary
Section Overview
Handling Rejection
Negotiation 101
Handling An Offer
Handling Multiple Offers
Getting A Raise
Exercise: Negotiation Master
Section Summary
Become an Alumni
Thank You.
What You Can Do Now
Coding Problems
Top Interview Questions
Amazon Interview Questions
Domain Specific Questions

Contributing To Open Source To Gain Experience
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review
Sorting Introduction
The Issue With sort()
Sorting Algorithms
Bubble Sort
Exercise: Bubble Sort
Solution: Bubble Sort
Selection Sort
Exercise: Selection Sort
Solution: Selection Sort
Dancing Algorithms
Insertion Sort
Exercise: Insertion Sort
Solution: Insertion Sort
Merge Sort and O(n log n)
Exercise: Merge Sort
Solution: Merge Sort
Stable VS Unstable Algorithms
Quick Sort
Optional Exercise: Quick Sort
Which Sort Is Best?
Resources: Heap Sort
Resources: Radix Sort + Counting Sort
Exercise: Sorting Interview
Solution: Sorting Interview
Sorting Review
Searching + Traversal Introduction
Linear Search
Binary Search
Graph + Tree Traversals
BFS Introduction
DFS Introduction
BFS vs DFS
Resources: BFS vs DFS
Exercise: BFS vs DFS
Solution: BFS vs DFS
PreOrder, InOrder, PostOrder
depthFirstSearch()
Optional Exercise: Validate A BST
Graph Traversals
BFS in Graphs
DFS in Graphs
Dijkstra + Bellman-Ford Algorithms
Searching + Traversal Review
Dynamic Programming Introduction
Memoization 1
Memoization 2
Fibonacci and Dynamic Programming
Dynamic Programming
Implementing Dynamic Programming
Interview Questions: Dynamic Programming
Dynamic Programming Review
Section Overview
During The Interview
Exercise: Hero Stories
Why Us?
Tell Me About A Problem You Have Solved
Exercise: Past Projects
Any Questions For Us?
Resources: Questions To Ask A Company
Secret Weapon
After The Interview
Section Summary
Section Overview
Handling Rejection
Negotiation 101
Handling An Offer
Handling Multiple Offers
Getting A Raise
Exercise: Negotiation Master
Section Summary
Become an Alumni
Thank You.
What You Can Do Now
Coding Problems
Top Interview Questions
Amazon Interview Questions
Domain Specific Questions
Contributing To Open Source
Contributing To Open Source 2
Exercise: Contribute To Open Source

Bonus: Extra Bits
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review
Sorting Introduction
The Issue With sort()
Sorting Algorithms
Bubble Sort
Exercise: Bubble Sort
Solution: Bubble Sort
Selection Sort
Exercise: Selection Sort
Solution: Selection Sort
Dancing Algorithms
Insertion Sort
Exercise: Insertion Sort
Solution: Insertion Sort
Merge Sort and O(n log n)
Exercise: Merge Sort
Solution: Merge Sort
Stable VS Unstable Algorithms
Quick Sort
Optional Exercise: Quick Sort
Which Sort Is Best?
Resources: Heap Sort
Resources: Radix Sort + Counting Sort
Exercise: Sorting Interview
Solution: Sorting Interview
Sorting Review
Searching + Traversal Introduction
Linear Search
Binary Search
Graph + Tree Traversals
BFS Introduction
DFS Introduction
BFS vs DFS
Resources: BFS vs DFS
Exercise: BFS vs DFS
Solution: BFS vs DFS
PreOrder, InOrder, PostOrder
depthFirstSearch()
Optional Exercise: Validate A BST
Graph Traversals
BFS in Graphs
DFS in Graphs
Dijkstra + Bellman-Ford Algorithms
Searching + Traversal Review
Dynamic Programming Introduction
Memoization 1
Memoization 2
Fibonacci and Dynamic Programming
Dynamic Programming
Implementing Dynamic Programming
Interview Questions: Dynamic Programming
Dynamic Programming Review
Section Overview
During The Interview
Exercise: Hero Stories
Why Us?
Tell Me About A Problem You Have Solved
Exercise: Past Projects
Any Questions For Us?
Resources: Questions To Ask A Company
Secret Weapon
After The Interview
Section Summary
Section Overview
Handling Rejection
Negotiation 101
Handling An Offer
Handling Multiple Offers
Getting A Raise
Exercise: Negotiation Master
Section Summary
Become an Alumni
Thank You.
What You Can Do Now
Coding Problems
Top Interview Questions
Amazon Interview Questions
Domain Specific Questions
Contributing To Open Source
Contributing To Open Source 2
Exercise: Contribute To Open Source
Learning Guideline
Quick Note: Upcoming Videos
From JTS: Learn to Learn
Coding Challenges
How To Use Leetcode
AMA - 100,000 Students!!

Extras
How To Succeed In This Course
Exercise: Meet The Community!
Section Overview
Resume
Exercise: Resume Walkthrough
Resume Review
Resources: Resume Templates
What If I Don't Have Enough Experience?
Optional Exercise: Github Master
Portfolio
Resources: Free Portfolio Templates
Email
Resources: Email
Where To Find Jobs?
Resources: Where To Find Jobs?
When Should You Start Applying?
Section Summary
Section Overview
What Is Good Code?
Big O and Scalability
O(n)
O(1)
Exercise: Big O Calculation
Solution: Big O Calculation
Exercise: Big O Calculation 2
Solution: Big O Calculation 2
Simplifying Big O
Big O Rule 1
Big O Rule 2
Big O Rule 3
O(n^2)
Big O Rule 4
Big O Cheat Sheet
What Does This All Mean?
O(n!)
3 Pillars Of Programming
Space Complexity
Exercise: Space Complexity
Optional: Javascript Loops
Section Summary
Section Overview
What Are Companies Looking For?
What We Need For Coding Interviews
Exercise: Interview Question
Exercise: Interview Question 2
Section Summary
Section Overview
What Is A Data Structure?
How Computers Store Data
Data Structures In Different Languages
Operations On Data Structures
Arrays Introduction
Static vs Dynamic Arrays
Quick Note: Upcoming Video
Optional: Classes In Javascript
Implementing An Array
Strings and Arrays
Exercise: Reverse A String
Solution: Reverse A String
Exercise: Merge Sorted Arrays
Solution: Merge Sorted Arrays
Interview Questions: Arrays
Arrays Review
Hash Tables Introduction
Hash Function
Hash Collisions
Hash Tables In Different Languages
Exercise: Implement A Hash Table
Solution: Implement A Hash Table
keys()
Hash Tables VS Arrays
Exercise: First Recurring Character
Solution: First Recurring Character
Hash Tables Review
What Is A Pointer?
Solution: append()
Solution: prepend()
Node Class
insert()
Solution: insert()
Solution: remove()
Exercise: reverse()
Solution: reverse()
Stacks + Queues Introduction
Stacks
Queues
Exercise: Stacks VS Queues
Solution: Stacks VS Queues
Quick Note: Upcoming Video
Optional: How Javascript Works
Exercise: Stack Implementation (Array)
Solution: Stack Implementation (Array)
Exercise: Queue Implementation
Solution: Queue Implementation
Queues Using Stacks
Stacks + Queues Review
Trees Introduction
Binary Trees
O(log n)
Correction: Binary Search Trees
Binary Search Trees
Balanced VS Unbalanced BST
BST Pros and Cons
Exercise: Binary Search Tree
Solution: insert()
Solution: lookup()
Bonus Exercise: remove()
Solution: remove()
AVL Trees + Red Black Trees
Resources: AVL Trees + Red Black Trees
Binary Heaps
Quick Note on Heaps
Priority Queue
Trie
Tree Review
Graphs Introduction
Types Of Graphs
Exercise: Guess The Graph
Graph Data
Exercise: Graph Implementation
Solution: Graph Implementation
Graphs Review
Data Structures Review
What Else Is Coming Up?
Introduction to Algorithms
Recursion Introduction
Stack Overflow
Anatomy Of Recursion
Exercise: Factorial
Solution: Factorial
Exercise: Fibonacci
Solution: Fibonacci
Recursive VS Iterative
When To Use Recursion
Exercise: Reverse String With Recursion
Recursion Review
Sorting Introduction
The Issue With sort()
Sorting Algorithms
Bubble Sort
Exercise: Bubble Sort
Solution: Bubble Sort
Selection Sort
Exercise: Selection Sort
Solution: Selection Sort
Dancing Algorithms
Insertion Sort
Exercise: Insertion Sort
Solution: Insertion Sort
Merge Sort and O(n log n)
Exercise: Merge Sort
Solution: Merge Sort
Stable VS Unstable Algorithms
Quick Sort
Optional Exercise: Quick Sort
Which Sort Is Best?
Resources: Heap Sort
Resources: Radix Sort + Counting Sort
Exercise: Sorting Interview
Solution: Sorting Interview
Sorting Review
Searching + Traversal Introduction
Linear Search
Binary Search
Graph + Tree Traversals
BFS Introduction
DFS Introduction
BFS vs DFS
Resources: BFS vs DFS
Exercise: BFS vs DFS
Solution: BFS vs DFS
PreOrder, InOrder, PostOrder
depthFirstSearch()
Optional Exercise: Validate A BST
Graph Traversals
BFS in Graphs
DFS in Graphs
Dijkstra + Bellman-Ford Algorithms
Searching + Traversal Review
Dynamic Programming Introduction
Memoization 1
Memoization 2
Fibonacci and Dynamic Programming
Dynamic Programming
Implementing Dynamic Programming
Interview Questions: Dynamic Programming
Dynamic Programming Review
Section Overview
During The Interview
Exercise: Hero Stories
Why Us?
Tell Me About A Problem You Have Solved
Exercise: Past Projects
Any Questions For Us?
Resources: Questions To Ask A Company
Secret Weapon
After The Interview
Section Summary
Section Overview
Handling Rejection
Negotiation 101
Handling An Offer
Handling Multiple Offers
Getting A Raise
Exercise: Negotiation Master
Section Summary
Become an Alumni
Thank You.
What You Can Do Now
Coding Problems
Top Interview Questions
Amazon Interview Questions
Domain Specific Questions
Contributing To Open Source
Contributing To Open Source 2
Exercise: Contribute To Open Source
Learning Guideline
Quick Note: Upcoming Videos
From JTS: Learn to Learn
Coding Challenges
How To Use Leetcode
AMA - 100,000 Students!!

8145 dl's @ 3442 KB/s
9950 dl's @ 3654 KB/s
5993 dl's @ 2071 KB/s

Search More...
Udemy - Master the Coding Interview; Data Structures Algorithms #Last updated 12-2019

Related Books