Topic: dynamic-programming-problem / Level: intermediate

• 1151. Solve the "Longest Increasing Path in a Matrix" problem where you can move in four directions and the value increases in each move using dynamic programming.
• 1152. Compute the minimum number of operations required to transform a string into another by only inserting, deleting, or replacing characters using dynamic programming.
• 1153. Solve the "Maximum Sum of Two Non-Overlapping Subarrays" problem using dynamic programming.
• 1154. Find the number of ways to partition an array into subsequences where each subsequence has an increasing order using dynamic programming.
• 1155. Solve the "Minimum Path Cost in a Grid with Obstacles" problem using dynamic programming.
• 1156. Compute the number of ways to tile a 4xN board using L-shaped trominoes and dominoes using dynamic programming.
• 1157. Solve the "Maximum Subarray Sum after One Operation" problem where you can replace one element in the array with its square to maximize the subarray sum using dynamic programming.
• 1158. Find the number of ways to decode a string where digits represent letters (A = 1, B = 2, ..., Z = 26) with at most one wildcard character using dynamic programming.
• 1159. Solve the "Maximum Sum of Non-Overlapping Intervals" problem where you find the maximum sum by selecting non-overlapping intervals from a list using dynamic programming.
• 1160. Compute the number of ways to split an array into k non-empty subarrays such that the sum of each subarray is increasing using dynamic programming.
• 1161. Solve the "Longest Common Subsequence with Constraints" problem where each subsequence must satisfy specific conditions using dynamic programming.
• 1162. Find the minimum number of operations to transform one binary string into another using dynamic programming.
• 1163. Solve the "Cutting Ribbons" problem where you maximize the number of equal-length ribbons that can be obtained from a set of ribbons using dynamic programming.
• 1164. Compute the maximum number of subsequences that can be selected from an array such that their sum does not exceed a given value using dynamic programming.
• 1165. Solve the "Longest Mountain in Array" problem where you find the longest subarray that forms a mountain using dynamic programming.
• 1166. Find the number of ways to tile a 5xN board using 1x2 and 2x2 dominoes using dynamic programming.
• 1167. Solve the "Count of Palindromic Subsequences" problem where you count the number of distinct palindromic subsequences in a string using dynamic programming.
• 1168. Compute the minimum number of steps required to reach the last cell in a grid with obstacles using dynamic programming.
• 1169. Solve the "Maximum Value of Coins in a 2D Grid" problem where you collect the maximum value of coins in a grid using dynamic programming.
• 1170. Find the longest subsequence in an array where the difference between adjacent elements is a prime number using dynamic programming.
• 1171. Solve the "Smallest Sufficient Team II" problem where you find the smallest team that can accomplish a set of tasks using dynamic programming.
• 1172. Compute the maximum profit from selling stocks with multiple transactions allowed and a transaction fee using dynamic programming.
• 1173. Solve the "Largest Rectangle in a 2D Binary Matrix" problem using dynamic programming.
• 1174. Find the number of ways to partition a string into palindromic subsequences with a given length using dynamic programming.
• 1175. Solve the "Maximum Product of Three Numbers" problem where you find the maximum product of any three numbers in an array using dynamic programming.
• 1176. Compute the minimum number of coins required to make change for a given amount with unlimited coins using dynamic programming.
• 1177. Solve the "Minimum Cost to Paint Houses III" problem where you minimize the cost to paint houses with additional constraints using dynamic programming.
• 1178. Find the longest subsequence where adjacent elements alternate between even and odd using dynamic programming.
• 1179. Solve the "Dice Throw" problem where you compute the number of ways to throw n dice to get a sum greater than or equal to a target value using dynamic programming.
• 1180. Compute the minimum number of moves required to reach the last cell in a grid with teleportation points using dynamic programming.
• 1181. Solve the "Maximum Value of Items You Can Collect" problem where you collect items from a set of piles with certain limitations using dynamic programming.
• 1182. Find the minimum cost to traverse a matrix with penalties for visiting specific cells using dynamic programming.
• 1183. Solve the "Minimum Number of Deletions to Make a String a Palindrome II" problem using dynamic programming.
• 1184. Compute the longest zigzag path in a grid where the path alternates between increasing and decreasing values using dynamic programming.
• 1185. Solve the "Longest Arithmetic Subsequence II" problem where the difference between adjacent elements is greater than or equal to k using dynamic programming.
• 1186. Find the maximum score you can achieve by collecting points from a set of non-overlapping ranges in an array using dynamic programming.
• 1187. Solve the "Partition Equal Subset Sum II" problem where you partition an array into two subsets with equal sum and certain restrictions using dynamic programming.
• 1188. Compute the number of ways to fill a 2D grid with 1x1 and 1x2 tiles using dynamic programming.
• 1189. Solve the "Word Search II" problem where you search for multiple words in a grid using dynamic programming.
• 1190. Find the longest palindromic subsequence where adjacent characters differ by exactly one using dynamic programming.
• 1191. Solve the "Kth Largest Sum Subarray" problem where you find the kth largest sum of subarrays using dynamic programming.
• 1192. Compute the minimum number of swaps required to sort an array with limited adjacent swaps allowed using dynamic programming.
• 1193. Solve the "Minimum Cost to Reach Target" problem where you minimize the cost to reach a target location using dynamic programming.
• 1194. Find the number of valid parenthesis strings that can be formed by adding characters to an existing string using dynamic programming.
• 1195. Solve the "Burst Balloons III" problem where you maximize the points obtained by bursting balloons with specific values using dynamic programming.
• 1196. Compute the number of ways to form a target string by concatenating words from a list using dynamic programming.
• 1197. Solve the "Minimum Path Sum II" problem where you find the minimum path sum in a weighted grid using dynamic programming.
• 1198. Find the longest subsequence in an array where adjacent elements differ by exactly 2 using dynamic programming.
• 1199. Solve the "Maximum Sum of Non-Adjacent Numbers" problem where you select non-adjacent numbers from a 2D grid to maximize the sum using dynamic programming.
• 1200. Compute the number of ways to partition a string into k palindromic subsequences using dynamic programming.

• More Levels

• Beginner
• Advanced