Nishant Gaurav·Oct 6Rod Cutting: Unbounded KnapsackChapter 7 introduced Unbounded Knapsack and ended with a promise: every problem in the unbounded family inherits the same structure, just…
Vishesh Sharma·Jun 9Alternative O(n²) Word Break Solution (Without DP / DFS / BFS / Trie)When tackling LeetCode 139 — Word Break, most engineers instinctively reach for Dynamic Programming, DFS + Memoization, or even Trie-based…
