💻
Algorithm
search
Ctrlk
  • README
  • Arraychevron-right
  • Binary Treechevron-right
  • Companychevron-right
  • Cppchevron-right
  • Data Structurechevron-right
  • Dynamic Programmingchevron-right
    • Knapsackchevron-right
      • 0 1 Knapsack
      • Bounded Knapsack
      • Unbounded Knapsack
    • Bitmask Dp
    • Dp On Subsets
    • Dp On Tree
    • Dp With Sorting
    • Selective State Dp
    • Travelling Salesperson
  • Graphchevron-right
  • Greedychevron-right
  • Mathchevron-right
  • Miscellaneouschevron-right
  • Sortchevron-right
  • Stlchevron-right
  • Stringchevron-right
  • Backtracking
  • Binary Answer
  • Binary Lifting
  • Binary Search
  • Bit Manipulation
  • Date
  • Difference Array
  • Discretization
  • Divide And Conquer
  • Gray Code
  • Great Problems For Practice
  • Interval Scheduling Maximization
  • Io Optimization
  • K Subset Partitioning
  • Line Sweep
  • Longest Common Subsequence
  • Longest Increasing Subsequence
  • Meet In The Middle
  • Minmax
  • Mono Deque
  • Monotonic Stack
  • Offline Query
  • P And Np
  • Prefix State Map
  • Prefix Sum
  • Random
  • Reservoir Sampling
  • Reverse Polish Notation
  • Sqrt Decomposition
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Dynamic Programmingchevron-right
  2. Knapsack

Bounded Knapsack

hashtag
Problems

  • 2585. Number of Ways to Earn Points (Hard)arrow-up-right

  • 2902. Count of Sub-Multisets With Bounded Sum (Hard)arrow-up-right

Previous0 1 Knapsackchevron-leftNextUnbounded Knapsackchevron-right

Last updated 2 years ago

Was this helpful?

Was this helpful?