PHASE 07
๐ง Algorithmic Thinking
Meet the classic algorithms and the patterns behind them: searching, counting, running totals, two pointers, sliding windows, sorting, divide and conquer, greedy thinking, recursion, backtracking, memoization and the intuition behind dynamic programming.
โฑ๏ธ ~6.5 hours of lessons
๐ 22 lessons
โ๏ธ 3 exercises ๐ 1 challenges Hard
๐ฏ In this phase you willโฆ
- Implement linear and binary search
- Use counting, running totals and prefix sums
- Apply two-pointer and sliding-window patterns
- Write selection, bubble and insertion sort
- Think recursively and build intuition for DP
๐บ Lessons in this playlist
01
What Is an Algorithm?
02
Linear Search
03
Binary Search
04
Counting
05
Frequency Counting
06
Minimum / Maximum
07
Running Totals
08
Prefix Totals
09
Two Pointers
10
Sliding Window
11
Sorting
12
Selection Sort
13
Bubble Sort
14
Insertion Sort
15
Divide and Conquer
16
Greedy Thinking
17
Recursion
18
Base Case
19
Recursive Case
20
Backtracking
21
Memoization
22
Dynamic Programming Intuition
