Dynamic Programming Part2
DP practice set: Fibonacci, max-subarray, 0-1 knapsack, and LCS intuition
Sitemap
- 📜 Posts
- 👨💻 About me
- 🏫 My Princeton homepage
Recent posts
Rod Cutting (DP Intro)
Rod-cutting as DP: brute force vs memoization vs bottom-up, plus solution reconstruction
AVL Search Tree
AVL trees: balance invariants, rotations, and why height stays O(log n)
Binary Search Tree (BST)
Binary search trees: core operations, successors, insertion, and deletion via transplant
Tree Basics & Tricks
Tree terminology, traversals, and a few practical iterative traversal tricks
Hashing
Hash tables from direct addressing to chaining and open addressing, with probe analysis