DP Multiple Knapsack¶
Table of Contents¶
- 2585. Number of Ways to Earn Points (Hard)
- 3333. Find the Original Typed String II (Hard)
- 2902. Count of Sub-Multisets With Bounded Sum (Hard)
2585. Number of Ways to Earn Points¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming
3333. Find the Original Typed String II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: string, dynamic programming, prefix sum
2902. Count of Sub-Multisets With Bounded Sum¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, hash table, dynamic programming, sliding window