Topic: dynamic-programming-problem / Level: intermediate

• 1201. Solve the "Longest Palindromic Substring with Deletions" problem where you can delete characters from the string to form the longest palindromic substring using dynamic programming.
• 1202. Compute the minimum number of operations to make two arrays identical where operations can include insertion, deletion, and substitution using dynamic programming.
• 1203. Solve the "Minimum Number of Refueling Stops II" problem where you compute the minimum number of refueling stops needed to reach the destination using dynamic programming.
• 1204. Find the number of ways to partition an array into two subsets where the sum of elements in one subset is a prime number using dynamic programming.
• 1205. Solve the "Maximum Length of Chain of Words" problem where you can form a chain of words by deleting exactly one letter at a time using dynamic programming.
• 1206. Compute the minimum cost to traverse a grid where some cells have penalties and others have rewards using dynamic programming.
• 1207. Solve the "Maximum Number of Books You Can Collect" problem where you collect books from shelves under certain conditions using dynamic programming.
• 1208. Find the number of ways to tile a 2xN board using L-shaped trominoes and 1x2 dominoes using dynamic programming.
• 1209. Solve the "Longest Zigzag Path in a Grid" problem where the path alternates between increasing and decreasing values using dynamic programming.
• 1210. Compute the number of ways to partition a set into k subsets such that the sum of each subset is equal using dynamic programming.
• 1211. Solve the "Longest Common Subsequence with K Changes" problem where you can change up to k characters to form the longest common subsequence using dynamic programming.
• 1212. Find the minimum number of insertions needed to make a string a palindrome using dynamic programming.
• 1213. Solve the "Maximum Sum of Products of Pairs" problem where you maximize the sum of products of pairs of elements from two arrays using dynamic programming.
• 1214. Compute the number of ways to partition a set into subsets where each subset has an even sum using dynamic programming.
• 1215. Solve the "Burst Balloons IV" problem where you maximize the coins collected by bursting balloons under certain conditions using dynamic programming.
• 1216. Find the longest subsequence in an array where adjacent elements have a difference greater than or equal to k using dynamic programming.
• 1217. Solve the "Minimum Number of Arrows to Burst Balloons II" problem using dynamic programming.
• 1218. Compute the minimum number of swaps required to sort an array of integers with restricted moves using dynamic programming.
• 1219. Solve the "Word Break IV" problem where you return all possible ways to break a string into valid words using dynamic programming.
• 1220. Find the longest increasing subsequence where adjacent elements differ by at most 2 using dynamic programming.
• 1221. Solve the "Edit Distance II" problem where you compute the minimum number of operations required to convert one string into another with certain restrictions using dynamic programming.
• 1222. Compute the longest common substring between three strings using dynamic programming.
• 1223. Solve the "Minimum Path to Escape a Maze" problem where you find the minimum path to escape a maze with obstacles using dynamic programming.
• 1224. Find the minimum cost to paint fences with at most k consecutive fences of the same color using dynamic programming.
• 1225. Solve the "Maximum Value of Coins You Can Collect II" problem where you collect coins from multiple paths in a 2D grid using dynamic programming.
• 1226. Compute the number of ways to partition a string into palindromic subsequences of equal length using dynamic programming.
• 1227. Solve the "Maximum Profit from Job Scheduling II" problem where you maximize profit from jobs with dependencies using dynamic programming.
• 1228. Find the longest subsequence in an array where adjacent elements are either increasing or decreasing by a constant value using dynamic programming.
• 1229. Solve the "Palindrome Partitioning III" problem where you compute the minimum number of cuts required to partition a string into k palindromic subsequences using dynamic programming.
• 1230. Compute the maximum sum of a subarray where you can replace up to one element with a fixed value using dynamic programming.
• 1231. Solve the "Longest Increasing Path in a Weighted Matrix" problem where you can move in four directions and must follow increasing weights using dynamic programming.
• 1232. Find the number of distinct ways to decode a string of digits where each digit represents a letter with wildcard characters using dynamic programming.
• 1233. Solve the "Cutting a Stick into Segments" problem where you minimize the cost of cutting a stick into specific lengths using dynamic programming.
• 1234. Compute the minimum number of deletions to make two strings equal using dynamic programming.
• 1235. Solve the "Maximum Sum of Non-Adjacent Numbers II" problem where you select non-adjacent numbers from a grid to maximize the sum using dynamic programming.
• 1236. Find the longest alternating subsequence in an array where adjacent elements alternate between even and odd values using dynamic programming.
• 1237. Solve the "Minimum Number of Swaps to Make a Binary String Alternating" problem using dynamic programming.
• 1238. Compute the longest subsequence in an array where adjacent elements have a difference of at least k using dynamic programming.
• 1239. Solve the "Palindrome Partitioning with Limited Cuts" problem where you compute the minimum number of cuts needed to partition a string into palindromes with at most k cuts using dynamic programming.
• 1240. Find the maximum value of a contiguous subarray with exactly k elements using dynamic programming.
• 1241. Solve the "Burst Balloons V" problem where you maximize the coins collected by bursting balloons of different sizes using dynamic programming.
• 1242. Compute the minimum number of refueling stops needed to reach the target destination with limited fuel capacity using dynamic programming.
• 1243. Solve the "Longest Increasing Subsequence II" problem where you compute the longest increasing subsequence with a given difference using dynamic programming.
• 1244. Find the number of ways to partition an array into k subsets such that each subset has an odd sum using dynamic programming.
• 1245. Solve the "Maximum Path Sum in a Triangle" problem where you find the maximum sum path from top to bottom of a triangle using dynamic programming.
• 1246. Compute the minimum cost to merge stones into one pile with varying costs for each merge using dynamic programming.
• 1247. Solve the "Maximum Number of Ways to Partition a String" problem where you compute the number of ways to partition a string into palindromes using dynamic programming.
• 1248. Find the minimum cost to reach a target point in a 2D grid with teleportation points using dynamic programming.
• 1249. Solve the "Best Time to Buy and Sell Stock with Transaction Fees" problem where you maximize profit while incurring transaction fees using dynamic programming.
• 1250. Compute the longest subsequence where adjacent elements in an array differ by exactly k using dynamic programming.

• More Levels

• Beginner
• Advanced