GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Sheets
  3. /Striver A2Z
  4. /Unbounded Knapsack
←Back to Striver A2Z
Curated IntersectionSheet: Striver A2ZPattern: Unbounded Knapsack

Striver A2Z · Unbounded Knapsack

DP where each item/coin can be reused an unlimited number of times while building toward a target.

Sheet Problems: 2
Category: Dynamic Programming
ℹ

Curated selection from Striver A2Z

This sheet features 2 problems testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the Unbounded Knapsack Pattern Guide.

Featured Problems (2)

1.Coin ChangeMedium
Solve↗
2.Coin Change IIMedium
Solve↗

Explore More Patterns in Striver A2Z

Track your progress across all 243 problems in this curriculum roadmap.

Back to Striver A2ZUnbounded Knapsack Pattern Guide
GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy