💻
Algorithm
CtrlK
  • README
  • Array
  • Binary Tree
  • Company
  • Cpp
  • Data Structure
  • Dynamic Programming
    • Knapsack
      • 0 1 Knapsack
      • Bounded Knapsack
      • Unbounded Knapsack
    • Bitmask Dp
    • Dp On Subsets
    • Dp On Tree
    • Dp With Sorting
    • Selective State Dp
    • Travelling Salesperson
  • Graph
  • Greedy
  • Math
  • Miscellaneous
  • Sort
  • Stl
  • String
  • 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
Powered by GitBook
On this page

Was this helpful?

  1. Dynamic Programming
  2. Knapsack

Bounded Knapsack

Problems

  • 2585. Number of Ways to Earn Points (Hard)

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

Previous0 1 KnapsackNextUnbounded Knapsack

Last updated 1 year ago

Was this helpful?