Home Learning Problems Roadmap Projects Blogs About

Systems

Data Plane Networking 4G / 5G Networks Operating Systems

Foundations

DSA

Arrays
Backtracking
Binary Search
Bit Manipulation — First-Principles Deep Dive
Ch12 Interview Cheat Sheet
DSA Mastery Roadmap
Dynamic Programming
Graphs
Greedy Algorithms
Hashing
Heaps
Intervals
Linked List
Master Problem List
Master Problem List
Queues
Recursion
Searching & Sorting Technique
Stacks
Strings
Data Structures Topics
Trees

System Design OOP Programming Languages

Applied

AI & ML Backend Competitive Programming Finance

Home›Learning Portal›Data Structures & Algorithms›Dynamic Programming›Knapsack Family

⏱ 1 min read

📑 Table of Contents

Knapsack Family

Knapsack Family

0/1, unbounded, bounded, subset sum, partition.

On this page

↑↓ navigate ↵ open esc close

About

About Me
Projects
Blog

Learning

DSA & Algorithms
System Design
Networking

Connect

GitHub LinkedIn

© 2026 Ajay Kumar Gupt. All rights reserved.

Built with Jekyll • Hosted on GitHub Pages