Micro Free Course — 100% Free Learning
All lessons in this module are free to learn. Sign in with Google to save your progress.
Advanced Patterns
Dynamic programming (memoization to tabulation); greedy and interval problems; binary search variations (including binary-search-on-answer); bit manipulation tricks.
Module Content
Dynamic Programming Basics
DP is recursion + memoization, or table-filling bottom-up. Master the 1D and 2D table patterns. FIND_VIDEO: search 'dynamic programming for beginners explained' — recommended channel: NeetCode / freeCodeCamp. Aim for 12 min or under.
Recap — From Memoization to Tabulation
The DP thought process. Identify subproblems, define a recurrence, decide top-down vs bottom-up.
Greedy & Interval Problems
When local choices give global optima. Interval scheduling, merging, and greedy patterns. FIND_VIDEO: search 'greedy algorithm interval scheduling interview' — recommended channel: NeetCode / William Fiset. Aim for 10 min or under.
Recap — When Greedy Works (and When It Doesn't)
The intuition for greedy. Interval scheduling and merging patterns. Why coin change is greedy for some denominations and DP for others.
Binary Search Variations
Beyond 'find X in sorted array': lower bound, upper bound, binary search on the answer. The pattern that turns O(N) into O(log N). FIND_VIDEO: search 'binary search variations explained interview' — recommended channel: NeetCode / Errichto. Aim for 11 min or under.
Recap — Binary Search on the Answer
The standard binary search; lower/upper bound variants; and the powerful 'binary search on the answer' pattern.
Bit Manipulation
XOR tricks, bit counting, power-of-2 checks. The handful of bit operations that pop up in interview problems. FIND_VIDEO: search 'bit manipulation tricks interview' — recommended channel: NeetCode / Tushar Roy. Aim for 9 min or under.
Recap — Bit Tricks Worth Memorizing
The essential bit operations and the canonical problems they solve.