Dynamic Programming problems

150 Dynamic Programming problems on CampusCode, in order. Open any for its full statement, examples and constraints.

• 1115. Climbing Stairs Easy
• 1116. Frog Jump — Min Cost to Reach Nth Stair Easy
• 1117. Fibonacci Number (Bottom-Up DP) Easy
• 1118. Tribonacci Number Easy
• 1119. Min Cost Climbing Stairs Easy
• 1120. House Robber I Easy
• 1121. House Robber II (Circular Array) Easy
• 1122. Jump Game I — Can Reach End Easy
• 1123. Jump Game II — Minimum Jumps Easy
• 1124. Decode Ways — Count Decodings Easy
• 1125. Counting Bits — Number of 1s for 0 to N Easy
• 1126. Perfect Squares — Min Number of Squares Easy
• 1127. Ugly Number II — Nth Ugly Number Easy
• 1128. N-th Tribonacci — Space Optimized Easy
• 1129. Get Maximum in Generated Array Easy
• 1130. Number of Ways to Reach a Position After K Steps Easy
• 1131. Divisor Game Easy
• 1132. Maximum Alternating Subsequence Sum Easy
• 1133. Count Ways to Make Change for Amount Easy
• 1134. Longest Increasing Subsequence Length (Basic) Easy
• 1135. Unique Paths in Grid Easy
• 1136. Unique Paths II — With Obstacles Easy
• 1137. Minimum Path Sum in Grid Easy
• 1138. Triangle — Minimum Path Sum Top to Bottom Easy
• 1139. Maximum Sum Path in Grid Easy
• 1140. Count All Paths from Top-Left to Bottom-Right Easy
• 1141. Cherry Pickup I — Max Cherries Easy
• 1142. Gold Mine Problem — Maximum Gold Easy
• 1143. Minimum Falling Path Sum Easy
• 1144. Number of Paths with Sum K in Grid Easy
• 1145. 0/1 Knapsack — Basic Easy
• 1146. Subset Sum Problem Easy
• 1147. Equal Partition Subset Sum Easy
• 1148. Count Subsets with Given Sum Easy
• 1149. Count Subsets with Given Difference Easy
• 1150. Target Sum — Assign + / - Signs Easy
• 1151. Minimum Subset Sum Difference Easy
• 1152. Unbounded Knapsack — Basic Easy
• 1153. Coin Change I — Minimum Coins Easy
• 1154. Coin Change II — Number of Ways Easy
• 1155. Rod Cutting Problem Easy
• 1156. Maximize the Cut Segments Easy
• 1157. Minimum Cost to Fill Given Weight Easy
• 1158. Maximum Ribbon Cut Easy
• 1159. Coin Change in Minimum Steps Easy
• 1160. Longest Common Subsequence — Basic Easy
• 1161. Longest Common Substring Easy
• 1162. Print Longest Common Subsequence Easy
• 1163. Shortest Common Supersequence Length Easy
• 1164. Minimum Insertions to Make String Palindrome Easy
• 1165. Minimum Deletions to Make String Palindrome Easy
• 1166. Longest Palindromic Subsequence Easy
• 1167. Count Palindromic Substrings (DP) Easy
• 1168. Minimum ASCII Delete Sum for Two Strings Easy
• 1169. Distinct Subsequences — Count Easy
• 1170. Wildcard Matching (? and *) Easy
• 1171. Regular Expression Matching (. and *) Easy
• 1172. Edit Distance (Levenshtein) Easy
• 1173. Interleaving String Easy
• 1174. Scramble String Easy
• 1175. Best Time to Buy and Sell Stock I Medium
• 1176. Best Time to Buy and Sell Stock II — Unlimited Medium
• 1177. Best Time to Buy and Sell Stock III — At Most 2 Medium
• 1178. Best Time to Buy and Sell Stock IV — At Most K Medium
• 1179. Buy and Sell with Cooldown Medium
• 1180. Buy and Sell with Transaction Fee Medium
• 1181. Longest Increasing Subsequence — O(n log n) Medium
• 1182. Longest Decreasing Subsequence Medium
• 1183. Longest Bitonic Subsequence Medium
• 1184. Number of Longest Increasing Subsequences Medium
• 1185. Largest Divisible Subset Medium
• 1186. Russian Doll Envelopes Medium
• 1187. Maximum Length of Pair Chain Medium
• 1188. Minimum Number of Removals to Make Mountain Array Medium
• 1189. Matrix Chain Multiplication Medium
• 1190. Burst Balloons Medium
• 1191. Minimum Cost to Merge Stones Medium
• 1192. Palindrome Partitioning II — Min Cuts Medium
• 1193. Strange Printer Medium
• 1194. Zuma Game Medium
• 1195. Minimum Score Triangulation of Polygon Medium
• 1196. Minimum Cost Tree from Leaf Values Medium
• 1197. Predict the Winner Medium
• 1198. Stone Game I Medium
• 1199. House Robber III — Tree DP Medium
• 1200. Diameter of Binary Tree (DP) Medium
• 1201. Maximum Independent Set on Tree Medium
• 1202. Distribute Coins in Binary Tree Medium
• 1203. Minimum Time to Collect All Apples Medium
• 1204. Count Paths in DAG with Constraints Medium
• 1205. Longest Path in a DAG Medium
• 1206. Minimum Jumps to Reach End (Graph DP) Medium
• 1207. Weighted Job Scheduling (DP + Binary Search) Medium
• 1208. Maximum Profit in Job Scheduling Medium
• 1209. Partition to K Equal Sum Subsets Medium
• 1210. Partition Array for Maximum Sum Medium
• 1211. Maximum Subarray Sum (Kadane's — DP View) Medium
• 1212. Maximum Sum Circular Subarray Medium
• 1213. Maximum Product Subarray Medium
• 1214. Maximum Score After Splitting String Medium
• 1215. Split Array Largest Sum (Binary Search + DP) Medium
• 1216. Minimum Cost to Cut a Stick Medium
• 1217. Dungeon Game — Minimum Health Medium
• 1218. Cherry Pickup I — Two-Pass DP Medium
• 1219. Maximum Points You Can Obtain from Cards Medium
• 1220. Count Vowels Permutations Medium
• 1221. Count Square Submatrices with All Ones Medium
• 1222. Maximal Square of Ones in Matrix Medium
• 1223. Largest Plus Sign Medium
• 1224. Number of Submatrices That Sum to Target Medium
• 1225. Travelling Salesman Problem (TSP) Hard
• 1226. Minimum Cost to Visit Every Node Hard
• 1227. Shortest Path Visiting All Nodes (BFS + Bitmask) Hard
• 1228. Partition Into Two Arrays to Minimize Sum Difference Hard
• 1229. Count Ways to Assign Tasks to Workers Hard
• 1230. Maximum AND Sum of Array Hard
• 1231. Beautiful Arrangement — Count Permutations Hard
• 1232. Number of Ways to Paint N x 3 Grid Hard
• 1233. Count Numbers with Unique Digits Hard
• 1234. Count Digit One — Numbers from 1 to N Hard
• 1235. Numbers at Most N Given Digit Set Hard
• 1236. Non-Negative Integers without Consecutive Ones Hard
• 1237. Count Special Integers Hard
• 1238. K-th Smallest in Lexicographic Order Hard
• 1239. Word Break II — All Sentence Splits Hard
• 1240. Palindrome Pairs Hard
• 1241. Distinct Subsequences II Hard
• 1242. Count Different Palindromic Subsequences Hard
• 1243. Minimum Window Subsequence Hard
• 1244. Shortest Common Supersequence — Print Hard
• 1245. Longest Common Subsequence of Three Strings Hard
• 1246. String Compression II Hard
• 1247. Stone Game II Hard
• 1248. Stone Game III Hard
• 1249. Stone Game IV Hard
• 1250. Stone Game VII Hard
• 1251. Nim Game Generalization Hard
• 1252. Grundy Number and Sprague-Grundy Theorem Hard
• 1253. Cherry Pickup II — Two Robots Hard
• 1254. Minimum Difficulty of a Job Schedule Hard
• 1255. Allocate Mailboxes Hard
• 1256. Minimum Total Distance Traveled Hard
• 1257. Paint House III — K Colours Hard
• 1258. Count All Valid Pickup and Delivery Options Hard
• 1259. 3D Knapsack — Two Constraints Hard
• 1260. Minimum Number of Work Sessions Hard
• 1261. Tallest Billboard Hard
• 1262. Last Stone Weight II Hard
• 1263. Ones and Zeroes Hard
• 1264. Super Egg Drop Hard