Topic: dynamic-programming-problem / Level: intermediate

• 1001. 0
• 1002. Compute the minimum cost to convert one string into another by inserting, deleting, or replacing characters using dynamic programming.
• 1003. Solve the "Longest Increasing Path in a Matrix" problem where each move can only go to a strictly greater number using dynamic programming.
• 1004. Find the number of distinct subsequences of a string that match a given pattern using dynamic programming.
• 1005. Solve the "Maximum Sum Rectangle in a 2D Matrix" problem using dynamic programming.
• 1006. Compute the number of ways to reach the nth stair where you can take 1, 2, or 3 steps using dynamic programming.
• 1007. Solve the "Palindrome Partitioning II" problem where you find the minimum number of cuts required to partition a string into palindromic substrings using dynamic programming.
• 1008. Compute the longest subsequence where the difference between adjacent elements is exactly 1 using dynamic programming.
• 1009. Solve the "Dungeon Game" problem to find the minimum initial health needed to reach the end of a dungeon using dynamic programming.
• 1010. Find the number of ways to fill an m x n grid using 1x2 dominoes and 2x2 squares using dynamic programming.
• 1011. Solve the "Unique Paths III" problem where the robot must visit every non-blocked square exactly once using dynamic programming.
• 1012. Compute the maximum sum of non-overlapping subarrays of size k using dynamic programming.
• 1013. Solve the "Scramble String" problem where two strings are scrambled versions of each other using dynamic programming.
• 1014. Find the maximum product of a contiguous subarray using dynamic programming.
• 1015. Solve the "Word Break II" problem where you return all possible ways to break a string into valid words using dynamic programming.
• 1016. Compute the number of ways to tile a 2xN grid using 1x2 and 2x2 tiles using dynamic programming.
• 1017. Solve the "Paint House II" problem where no two adjacent houses can have the same color and there are k different colors using dynamic programming.
• 1018. Compute the number of distinct ways to climb a staircase where you can take up to k steps at a time using dynamic programming.
• 1019. Solve the "Burst Balloons" problem where you maximize the coins collected by bursting balloons using dynamic programming.
• 1020. Find the minimum number of squares that sum to a given number using dynamic programming.
• 1021. Solve the "Longest Arithmetic Subsequence" problem where the difference between adjacent elements in the subsequence is constant using dynamic programming.
• 1022. Compute the maximum number of non-overlapping intervals from a set of intervals using dynamic programming.
• 1023. Solve the "Palindromic Substrings" problem where you count the number of palindromic substrings in a given string using dynamic programming.
• 1024. Find the maximum sum of a subarray with at most k elements using dynamic programming.
• 1025. Solve the "Split Array Largest Sum" problem where you split an array into k subarrays, minimizing the largest sum among them using dynamic programming.
• 1026. Compute the longest subsequence in an array where the difference between adjacent elements is exactly k using dynamic programming.
• 1027. Solve the "Maximal Square" problem where you find the largest square containing only 1s in a binary matrix using dynamic programming.
• 1028. Find the maximum value that can be obtained from cutting a rod into smaller pieces with varying prices for each length using dynamic programming.
• 1029. Solve the "Edit Distance" problem where you compute the minimum number of operations required to convert one string into another using dynamic programming.
• 1030. Compute the number of ways to partition a set of n elements into k non-empty subsets using dynamic programming.
• 1031. Solve the "Largest Rectangle in Histogram" problem where you find the largest rectangle that can be formed in a histogram using dynamic programming.
• 1032. Compute the number of distinct ways to arrange n items into k distinct boxes where no box is empty using dynamic programming.
• 1033. Solve the "Palindrome Partitioning" problem where you return all possible ways to partition a string into palindromic substrings using dynamic programming.
• 1034. Find the maximum sum of non-adjacent numbers in a 2D grid using dynamic programming.
• 1035. Solve the "Minimum Path Sum" problem where you need to find the minimum sum path from the top-left corner to the bottom-right corner of a grid using dynamic programming.
• 1036. Compute the minimum number of jumps to reach the last index of an array where each element represents the maximum jump length using dynamic programming.
• 1037. Solve the "Longest Repeating Subsequence" problem where you find the longest subsequence that repeats itself in a string using dynamic programming.
• 1038. Find the minimum number of operations required to convert a binary string into another binary string using dynamic programming.
• 1039. Solve the "Maximum Length of Repeated Subarray" problem where you find the maximum length of a subarray that appears in both arrays using dynamic programming.
• 1040. Compute the minimum number of trials needed to find the critical floor in the "Egg Dropping Problem" using dynamic programming.
• 1041. Solve the "Count of Distinct Palindromic Substrings" problem using dynamic programming.
• 1042. Find the number of ways to partition an array into two subsets with equal sum using dynamic programming.
• 1043. Solve the "Maximum Profit in Job Scheduling" problem where you maximize the profit earned by scheduling non-overlapping jobs using dynamic programming.
• 1044. Compute the longest subsequence in an array where the difference between adjacent elements is at most 1 using dynamic programming.
• 1045. Solve the "Smallest Sufficient Team" problem where you find the smallest team of people who collectively have all the required skills using dynamic programming.
• 1046. Find the number of ways to tile a 3xN grid using 1x2 dominoes and 2x2 squares using dynamic programming.
• 1047. Solve the "Longest String Chain" problem where you find the longest chain of words that can be formed by adding one letter at a time using dynamic programming.
• 1048. Compute the minimum number of swaps required to sort an array using dynamic programming.
• 1049. Solve the "Maximum Height by Stacking Cuboids" problem using dynamic programming.
• 1050. Find the minimum number of insertions needed to make a string a palindrome using dynamic programming.

• More Levels

• Beginner
• Advanced