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 | 力扣 Tags: Array, Dynamic Programming 3333. Find the Original Typed String II¶ LeetCode | 力扣 Tags: String, Dynamic Programming, Prefix Sum 2902. Count of Sub-Multisets With Bounded Sum¶ LeetCode | 力扣 Tags: Array, Hash Table, Dynamic Programming, Sliding Window