1D DP problems

20 1D DP DSA practice problems on CampusCode, each with statement, examples and constraints.

• 1115. Climbing Stairs Easy Dynamic Programming
• 1116. Frog Jump — Min Cost to Reach Nth Stair Easy Dynamic Programming
• 1117. Fibonacci Number (Bottom-Up DP) Easy Dynamic Programming
• 1118. Tribonacci Number Easy Dynamic Programming
• 1119. Min Cost Climbing Stairs Easy Dynamic Programming
• 1120. House Robber I Easy Dynamic Programming
• 1121. House Robber II (Circular Array) Easy Dynamic Programming
• 1122. Jump Game I — Can Reach End Easy Dynamic Programming
• 1123. Jump Game II — Minimum Jumps Easy Dynamic Programming
• 1124. Decode Ways — Count Decodings Easy Dynamic Programming
• 1125. Counting Bits — Number of 1s for 0 to N Easy Dynamic Programming
• 1126. Perfect Squares — Min Number of Squares Easy Dynamic Programming
• 1127. Ugly Number II — Nth Ugly Number Easy Dynamic Programming
• 1128. N-th Tribonacci — Space Optimized Easy Dynamic Programming
• 1129. Get Maximum in Generated Array Easy Dynamic Programming
• 1130. Number of Ways to Reach a Position After K Steps Easy Dynamic Programming
• 1131. Divisor Game Easy Dynamic Programming
• 1132. Maximum Alternating Subsequence Sum Easy Dynamic Programming
• 1133. Count Ways to Make Change for Amount Easy Dynamic Programming
• 1134. Longest Increasing Subsequence Length (Basic) Easy Dynamic Programming