๐Ÿงฉ Programming Through Pseudocode
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.

โฑ๏ธ 4โ€“5 weeks ๐Ÿ“š 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? ๐Ÿšง Coming soon
02 Linear Search ๐Ÿšง Coming soon
03 Binary Search ๐Ÿšง Coming soon
04 Counting ๐Ÿšง Coming soon
05 Frequency Counting ๐Ÿšง Coming soon
06 Minimum / Maximum ๐Ÿšง Coming soon
07 Running Totals ๐Ÿšง Coming soon
08 Prefix Totals ๐Ÿšง Coming soon
09 Two Pointers ๐Ÿšง Coming soon
10 Sliding Window ๐Ÿšง Coming soon
11 Sorting ๐Ÿšง Coming soon
12 Selection Sort ๐Ÿšง Coming soon
13 Bubble Sort ๐Ÿšง Coming soon
14 Insertion Sort ๐Ÿšง Coming soon
15 Divide and Conquer ๐Ÿšง Coming soon
16 Greedy Thinking ๐Ÿšง Coming soon
17 Recursion ๐Ÿšง Coming soon
18 Base Case ๐Ÿšง Coming soon
19 Recursive Case ๐Ÿšง Coming soon
20 Backtracking ๐Ÿšง Coming soon
21 Memoization ๐Ÿšง Coming soon
22 Dynamic Programming Intuition ๐Ÿšง Coming soon