Topic: dynamic-programming-problem / Level: intermediate

• 1101. Solve the "Maximum Sum of Increasing Subsequence" problem using dynamic programming.
• 1102. Compute the number of ways to partition an array into k subsets with the same sum using dynamic programming.
• 1103. Solve the "Minimum Cost to Cut a Stick" problem where you minimize the cost to cut a stick into segments using dynamic programming.
• 1104. Find the number of distinct ways to decode a message where digits may map to letters (A = 1, B = 2, ..., Z = 26) with wildcard characters using dynamic programming.
• 1105. Solve the "Minimum Moves to Equal Array Elements II" problem where you minimize the number of moves needed to make all elements in an array equal using dynamic programming.
• 1106. Compute the longest zigzag subsequence in an array where elements alternately increase and decrease using dynamic programming.
• 1107. Solve the "Minimum Deletions to Make a String Palindrome" problem using dynamic programming.
• 1108. Find the maximum number of non-overlapping subarrays with a sum equal to a target value using dynamic programming.
• 1109. Solve the "Minimum Cost to Merge Stones" problem where you minimize the cost to merge piles of stones into one pile using dynamic programming.
• 1110. Compute the number of ways to tile a 3xN board using 1x2 and 2x1 dominoes using dynamic programming.
• 1111. Solve the "Maximum Profit from Job Scheduling with Dependencies" problem using dynamic programming.
• 1112. Find the minimum number of jumps required to reach the last index of an array where each element represents the maximum jump length using dynamic programming.
• 1113. Solve the "Tallest Stack of Books" problem where you maximize the height of a stack of books where no book on top is heavier or larger than the one below using dynamic programming.
• 1114. Compute the maximum length of a chain of words that can be formed by adding one letter at a time using dynamic programming.
• 1115. Solve the "Minimum Insertions to Form a Palindrome" problem using dynamic programming.
• 1116. Find the number of ways to climb a staircase where you can take up to k steps at a time and certain steps are broken using dynamic programming.
• 1117. Solve the "Maximum Length of Pair Chain" problem where you find the maximum length of a chain of pairs using dynamic programming.
• 1118. Compute the minimum cost to reach the bottom-right corner of a grid where you can only move right or down using dynamic programming.
• 1119. Solve the "Number of Distinct Palindromic Substrings" problem using dynamic programming.
• 1120. Find the maximum number of ways to partition an array into subsequences where each subsequence has equal sum using dynamic programming.
• 1121. Solve the "Longest Palindromic Substring with K Changes" problem where you can change up to k characters using dynamic programming.
• 1122. Compute the longest increasing subsequence where the difference between adjacent elements is greater than or equal to k using dynamic programming.
• 1123. Solve the "Coin Change II" problem where you find the number of distinct ways to make change for a given amount using dynamic programming.
• 1124. Find the minimum number of deletions required to make two strings equal using dynamic programming.
• 1125. Solve the "Maximum Value of Coins You Can Collect" problem where you pick coins from piles such that no more than k coins are taken from each pile using dynamic programming.
• 1126. Compute the number of distinct subsequences that can be formed from a string using dynamic programming.
• 1127. Solve the "Minimum Number of Refueling Stops" problem where you compute the minimum number of stops needed to reach a destination using dynamic programming.
• 1128. Find the longest palindromic subsequence that can be formed by removing at most k characters from a string using dynamic programming.
• 1129. Solve the "Maximum Length of Palindromic Subsequence" problem where you compute the length of the longest palindromic subsequence using dynamic programming.
• 1130. Compute the minimum cost to remove all characters from a string by repeatedly deleting palindromic subsequences using dynamic programming.
• 1131. Solve the "Minimum Number of Arrows to Burst Balloons" problem using dynamic programming.
• 1132. Find the number of ways to partition an array into two subsets with equal sums where the sum of one subset is a given target using dynamic programming.
• 1133. Solve the "Minimum Number of Coins to Make Change" problem where you compute the minimum number of coins needed to make a given amount using dynamic programming.
• 1134. Compute the minimum number of insertions required to make a string a palindrome using dynamic programming.
• 1135. Solve the "Longest Common Subsequence with At Most k Changes" problem where you can change up to k characters in both strings using dynamic programming.
• 1136. Find the maximum number of non-overlapping intervals that can be selected from a list of intervals using dynamic programming.
• 1137. Solve the "Edit Distance with k Replacements" problem where you can replace up to k characters in both strings to make them identical using dynamic programming.
• 1138. Compute the number of ways to partition a string into palindromic substrings using dynamic programming.
• 1139. Solve the "Minimum Deletions to Make a String a Palindrome" problem using dynamic programming.
• 1140. Find the number of distinct subsequences that can be formed from a string and match a given target string using dynamic programming.
• 1141. Solve the "Maximum Length of Repeated Substring" problem using dynamic programming.
• 1142. Compute the longest subsequence where adjacent elements alternate between even and odd using dynamic programming.
• 1143. Solve the "Palindrome Partitioning II" problem where you compute the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.
• 1144. Find the number of ways to arrange dominoes on a 3xN board using dynamic programming.
• 1145. Solve the "Super Egg Drop" problem where you minimize the number of trials to find the critical floor using dynamic programming.
• 1146. Compute the minimum cost to split a string into palindromes using dynamic programming.
• 1147. Solve the "Longest Arithmetic Subsequence of Given Difference" problem where adjacent elements in the subsequence have a specific difference using dynamic programming.
• 1148. Find the minimum number of steps to convert a string into a target string by only inserting or deleting characters using dynamic programming.
• 1149. Solve the "Tiling a Rectangle with the Fewest Squares" problem where you compute the minimum number of squares needed to tile a rectangle using dynamic programming.
• 1150. Compute the longest common subsequence in three strings using dynamic programming.

• More Levels

• Beginner
• Advanced