Course Introduction

The Goal of The Course

How To Get The Most From This Course
Helpful Supplementary Material
Should You Time Yourself?
Closing Thoughts
Getting Referrals
Effective Recruiter Communication
Introducing Asymptotic Measures
O(1) Time (“Constant Time”)
O(log(n)) (“Logarithmic Time”)
O(n) (“Linear Time”)
O(n * log(n))
O(n!) ("Factorial Time")
O(|V| + |E|)
Approximating Time Complexities of Recursive Functions
Useful Recurrence Generalizations
The Master Theorem
Memoization
Check If A Number Is A Palindrome
Changing Base
Rotating a 2D Matrix
Spiral Traversal of A Matrix
The 3-Sum Problem
Longest Palindrome Construction
Pattern Matching
Fundamentals: Linked Lists
Design A Linked List
Even Odd Partition
Swap Linked List Nodes In Pairs
Sublist Reversal
Testing For Cycles
Testing For Overlapping Lists (No Cycles)
Remove kth Last Element
Right Shift A Singly Linked List
Add 2 Integers Represented As Linked Lists
Flatten A Multilevel Doubly Linked List
The Balanced Parentheses Problem
Compute Buildings With A Sunset View
Implement A Circular Queue
Implement A Queue With A Max API
Implement Text Editor Undo/Redo
Longest Node To Node Path In A Binary Tree
Test If A Binary Tree Is Symmetric
Sum Root To Leaf Paths
Compute A Node's Inorder Successor
Tree Reconstruction
Test A Tree For The BST Property
Build A Min-Height BST From A Sorted Array
Insertion & Deletion In A BST
Populating Level Pointers
Inorder Traversal Without Recursion
Implement A Trie
Fundamentals: Heaps
Merge K Sorted Arrays
K Largest/Smallest Elements In An Array
Compute The Median of Online Data
K Largest Elements In An Immutable Max-Heap
Intersection of 2 Sorted Arrays
Minimum Item In A Rotated Sorted Array
Fundamentals: Hashtables
Implement An LRU Cache
Nearest Repeated Entries In An Array
Naive Sorting Algorithms & Applications (Bubble, Insertion, Selection)
The Most Visited Pages Problem
Divide & Conquer Methodology
Implement A Sudoku Solver
Search A Linked List With Jump References
Phone Number Mnemonics
IP Address Restoration
The N Queens Problem
Permutations
Generate The Powerset
Generate All Subsets of Size K
Palindromic Decompositions
Generate Unique Binary Search Trees
Fundamentals: Dynamic Programming
Score Combinations (Total Ways To Make Change)
Buy & Sell Stock Once
Number of Ways To Traverse A Matrix
Minimum Weight Path In A Triangle
Decode Ways
Levenshtein Distance
Longest Non-Decreasing Subsequence
The 0/1 Knapsack Problem
DNA Sequence Alignment
1D Subproblems vs. 2D Subproblems
Fundamentals: Greedy Algorithms
Minimum Spanning Trees
Erase Interval Overlaps
Fundamentals: Graphs
Depth First Search & Breadth First Search
Keys & Rooms
Search A Maze For An Exit
Paint A Matrix
Compute Enclosed Regions
Detect A Cycle In A Graph (Deadlock Detection)
String Transformations
Check If A Graph Is Bipartite
Clone A Graph
Testing Strong Connectivity
Directory Access (Dropbox)