Topic: dynamic-programming-problem / Level: beginner

• 101. Compute the maximum sum of a contiguous subarray using dynamic programming.
• 102. Solve the "House Robber II" problem where houses are arranged in a circle.
• 103. Find the number of ways to tile a 2xN grid using 1x2 dominos.
• 104. Determine the minimum cost path from the top-left to the bottom-right of a grid where each cell has a cost.
• 105. Compute the number of ways to make a given amount using a fixed set of coins using dynamic programming.
• 106. Solve the "Unique Paths" problem where the only moves allowed are right and down.
• 107. Find the maximum value that can be obtained from cutting a rod into smaller pieces using dynamic programming.
• 108. Compute the minimum number of operations required to reduce a number to 1 using dynamic programming.
• 109. Determine the number of distinct palindromic subsequences in a string using dynamic programming.
• 110. Solve the "Longest Palindromic Substring" problem.
• 111. Find the minimum cost to climb a staircase where each step has a different cost.
• 112. Compute the minimum cost to reach the end of a grid where each cell has a cost and you can only move right or down.
• 113. Solve the "Maximum Product Subarray" problem using dynamic programming.
• 114. Determine the number of ways to tile a 3xN grid using 1x2 and 2x2 tiles.
• 115. Compute the minimum cost to paint n houses where no two adjacent houses can have the same color.
• 116. Solve the "Perfect Squares" problem where you need to find the least number of perfect squares that sum up to a given number.
• 117. Find the number of distinct subsequences of a string that match a given pattern.
• 118. Compute the minimum number of jumps to reach the last index of an array.
• 119. Determine if it is possible to partition a set into two subsets with equal sums.
• 120. Solve the "Paint House Problem" to minimize the cost of painting n houses where no two adjacent houses have the same color.
• 121. Find the minimum number of edits required to make two strings identical.
• 122. Compute the number of ways to reach the nth stair when you can take 1, 2, or 3 steps at a time.
• 123. Solve the "Minimum Path Sum" problem in a grid using dynamic programming.
• 124. Find the longest palindromic subsequence in a string using dynamic programming.
• 125. Compute the number of distinct ways to tile a 2xN grid using 2x1 dominos.
• 126. Solve the "Climbing Stairs with Variable Steps" problem where you can take up to k steps at a time.
• 127. Find the maximum profit from buying and selling a stock where you can only complete one transaction.
• 128. Compute the minimum number of insertions required to make a string a palindrome.
• 129. Determine the number of distinct ways to arrange n items into k boxes where each box has at least one item.
• 130. Solve the "Knapsack Problem" where repetition of items is allowed.
• 131. Find the minimum number of squares that sum to a given number.
• 132. Compute the number of distinct ways to climb a staircase with a maximum of k steps at a time.
• 133. Solve the "Subset Sum Problem" where you need to determine if there is a subset that sums to a given value.
• 134. Find the maximum sum of non-adjacent elements in an array using dynamic programming.
• 135. Compute the longest alternating subsequence in an array.
• 136. Determine the number of distinct palindromic substrings in a string.
• 137. Solve the "Word Ladder Problem" to find the shortest transformation sequence from one word to another.
• 138. Find the number of valid ways to place parentheses in a given mathematical expression to maximize its value.
• 139. Compute the minimum number of operations to transform one string into another using dynamic programming.
• 140. Solve the "Egg Drop Problem" to find the minimum number of trials needed to find the critical floor from which an egg will break.
• 141. Find the longest zigzag subsequence in an array.
• 142. Compute the number of ways to assign items to bins where each bin has a capacity constraint.
• 143. Solve the "Palindromic Substring Count Problem" using dynamic programming.
• 144. Determine if a string can be rearranged into a palindrome using dynamic programming.
• 145. Find the maximum length of a subarray with alternating even and odd elements.
• 146. Compute the number of ways to partition an array into non-empty subsets with equal sums.
• 147. Solve the "Stock Buy and Sell Problem" where you can make multiple transactions but cannot hold more than one stock at a time.
• 148. Find the minimum number of deletions required to make a string palindrome.
• 149. Compute the maximum sum of a subarray using dynamic programming.
• 150. Solve the "Edit Distance Problem" where you need to transform one string into another with the minimum number of edits.

• More Levels

• Intermediate
• Advanced