0/1 Knapsack Problem: DP Solution with Space Optimization
3 min read The 0/1 Knapsack problem is one of the most important DP patterns. Unlike coin change (unbounded knapsack), each item can […] Read article
Dynamic Programming
newsletter
What's actually being asked right now
Interview patterns & comp trends, straight to your inbox.
No spam. Unsubscribe anytime.
worth a read
Mars For The Rest of Us — a weekly-or-more deep dive on the technical side of Mars exploration: rocket propulsion, microbiology, mission architecture, and everything in between. Written by Maciej Ceglowski.
Read it on Substack →