Topic: dynamic-programming-problem / Level: intermediate

• 1251. Solve the "Minimum Number of Steps to Reduce a Number to 1" problem where you can only divide by 2, subtract 1, or divide by 3 using dynamic programming.
• 1252. Compute the number of ways to climb a staircase where you can take 1 to k steps at a time and some steps are broken using dynamic programming.
• 1253. Solve the "Maximum Product of Splitting a Number" problem where you maximize the product of integers obtained by splitting a number using dynamic programming.
• 1254. Find the number of distinct subsequences of a string that match a given target string with wildcard characters using dynamic programming.
• 1255. Solve the "Shortest Path to Reach All Points" problem where you calculate the shortest path to visit all given points on a grid using dynamic programming.
• 1256. Compute the longest subsequence where adjacent elements have a difference of at least 2 using dynamic programming.
• 1257. Solve the "Maximum Value of Coins You Can Collect III" problem where you collect coins from a 2D grid and are allowed to make certain moves using dynamic programming.
• 1258. Find the number of ways to partition an array into subsequences such that the sum of each subsequence is a multiple of k using dynamic programming.
• 1259. Solve the "Tallest Tower of Boxes" problem where you maximize the height of a tower built using boxes of different sizes using dynamic programming.
• 1260. Compute the minimum number of deletions to make two strings anagrams of each other using dynamic programming.
• 1261. Solve the "Maximum Number of Palindromic Subsequences" problem where you find the maximum number of palindromic subsequences in a string using dynamic programming.
• 1262. Find the minimum cost to travel from the top-left corner to the bottom-right corner of a grid with obstacles using dynamic programming.
• 1263. Solve the "Minimum Cost to Paint Houses IV" problem where no more than two adjacent houses can have the same color using dynamic programming.
• 1264. Compute the number of ways to partition a set into k subsets with non-decreasing sums using dynamic programming.
• 1265. Solve the "Best Time to Buy and Sell Stock with At Most Two Transactions" problem using dynamic programming.
• 1266. Find the longest increasing subsequence in an array where adjacent elements alternate between even and odd using dynamic programming.
• 1267. Solve the "Minimum Cost to Merge Files" problem where you minimize the cost to merge files into one using dynamic programming.
• 1268. Compute the number of ways to fill a grid of size m x n with 1x1, 1x2, and 2x1 tiles using dynamic programming.
• 1269. Solve the "Maximum Length of Subsequence of Given Sum" problem where you compute the maximum length of a subsequence with a given sum using dynamic programming.
• 1270. Find the minimum number of operations to make two arrays identical where you are allowed to perform certain operations on elements using dynamic programming.
• 1271. Solve the "Minimum Number of Operations to Make Two Strings Equal" problem using dynamic programming.
• 1272. Compute the longest subsequence in an array where adjacent elements have a difference that is a prime number using dynamic programming.
• 1273. Solve the "Word Break V" problem where you compute the number of ways to break a string into valid words using dynamic programming.
• 1274. Find the minimum number of steps to reach a target sum by adding or subtracting elements from a set using dynamic programming.
• 1275. Solve the "Longest Common Subsequence with Limited Deletions" problem where you can delete up to k characters from each string using dynamic programming.
• 1276. Compute the maximum sum of a subarray where you can replace one element with a given value using dynamic programming.
• 1277. Solve the "Palindrome Partitioning with Constraints" problem where you partition a string into palindromic subsequences with specific constraints using dynamic programming.
• 1278. Find the number of ways to partition a set of elements into subsets such that each subset has an even sum using dynamic programming.
• 1279. Solve the "Shortest Path to Collect All Coins" problem in a grid with obstacles using dynamic programming.
• 1280. Compute the minimum number of operations to convert one binary matrix into another using dynamic programming.
• 1281. Solve the "Maximum Value of Non-Overlapping Subarrays" problem where you maximize the sum by selecting non-overlapping subarrays from a list using dynamic programming.
• 1282. Find the longest increasing subsequence in an array where adjacent elements differ by exactly 3 using dynamic programming.
• 1283. Solve the "Best Time to Buy and Sell Stock with At Most Three Transactions" problem using dynamic programming.
• 1284. Compute the minimum cost to traverse a grid where some cells are restricted using dynamic programming.
• 1285. Solve the "Longest Substring with At Most K Distinct Characters" problem where you find the longest substring with at most k distinct characters using dynamic programming.
• 1286. Find the minimum number of refueling stops required to reach the destination with limited fuel using dynamic programming.
• 1287. Solve the "Maximum Length of Repeated Subsequence" problem where you find the maximum length of a subsequence that appears twice in a string using dynamic programming.
• 1288. Compute the minimum number of operations to make two arrays have the same sum using dynamic programming.
• 1289. Solve the "Partition Equal Subset Sum III" problem where you partition an array into two subsets with equal sums under certain conditions using dynamic programming.
• 1290. Find the longest subsequence where adjacent elements alternate between positive and negative values using dynamic programming.
• 1291. Solve the "Tiling a 4xN Board with L-Shaped Trominoes" problem using dynamic programming.
• 1292. Compute the minimum number of swaps required to sort an array of integers with restrictions on moves using dynamic programming.
• 1293. Solve the "Shortest Path to Reach All Targets" problem where you calculate the shortest path to visit all target locations in a grid using dynamic programming.
• 1294. Find the maximum sum of a subarray where no two elements are adjacent using dynamic programming.
• 1295. Solve the "Burst Balloons VI" problem where you maximize the coins collected by bursting balloons with different values and conditions using dynamic programming.
• 1296. Compute the minimum cost to merge multiple strings into one string with penalties for certain merges using dynamic programming.
• 1297. Solve the "Maximum Path Sum in a Weighted Grid" problem where you find the maximum sum path from the top-left to the bottom-right corner using dynamic programming.
• 1298. Find the longest common subsequence between two strings where certain characters can be ignored using dynamic programming.
• 1299. Solve the "Minimum Number of Moves to Make Two Strings Equal" problem where you compute the minimum number of operations to make two strings identical using dynamic programming.
• 1300. Compute the number of ways to partition a set of elements into subsets where each subset has a given sum using dynamic programming.

• More Levels

• Beginner
• Advanced