Unbounded KS problems

9 Unbounded KS DSA practice problems on CampusCode, each with statement, examples and constraints.

• 1133. Count Ways to Make Change for Amount Easy Dynamic Programming
• 1152. Unbounded Knapsack — Basic Easy Dynamic Programming
• 1153. Coin Change I — Minimum Coins Easy Dynamic Programming
• 1154. Coin Change II — Number of Ways Easy Dynamic Programming
• 1155. Rod Cutting Problem Easy Dynamic Programming
• 1156. Maximize the Cut Segments Easy Dynamic Programming
• 1157. Minimum Cost to Fill Given Weight Easy Dynamic Programming
• 1158. Maximum Ribbon Cut Easy Dynamic Programming
• 1159. Coin Change in Minimum Steps Easy Dynamic Programming