String Dynamic Programming Tabulation Guru Implement the editDistanceSimple method that returns the minimum edit operations needed to convert one string into another. Solved
String Dynamic Programming Tabulation Proficient Implement the longestCommonSubsequenceLength method that returns the length of the longest common subsequence of two strings. Solved
Array Dynamic Programming Tabulation Proficient Implement the longestIncreasingSubsequenceLength method that returns the length of the longest strictly increasing subsequence. Solved
Array Math Dynamic Programming Tabulation Proficient Implement the minimumCoinsToMakeAmount method that finds the minimum number of coins required to make the target amount. Solved
Array Math Dynamic Programming Tabulation Proficient Implement the countWaysToMakeAmount method that counts how many combinations can make the target amount using coins. Solved
Array Dynamic Programming Tabulation Intermediate Implement the maximumNonAdjacentSum method that finds the maximum sum using values that are not adjacent. Solved
Array Dynamic Programming Tabulation Learner Implement the minimumCostToClimb method that finds the minimum cost needed to reach the top of the stairs. Solved
Math Dynamic Programming Memoization Tabulation Learner Implement the fibonacciDP method that returns the nth Fibonacci number using dynamic programming. Solved
Dynamic Programming Recursion Memoization Tabulation Learner Implement the climbStairsWays method that returns the number of distinct ways to climb n stairs. Solved
String Dynamic Programming Pattern Matching Guru Implement the method isWildcardMatch that checks whether a string matches a wildcard pattern. Solved
String Dynamic Programming Recursion Guru Implement the method editDistance that returns the minimum number of edits needed to convert one string into another. Solved
String Dynamic Programming Proficient Implement the method countPalindromicSubstrings that counts all palindromic substrings. Solved
Array Dynamic Programming Proficient Implement the method longestIncreasingSubsequence that returns the length of the longest strictly increasing subsequence. Solved
Math Dynamic Programming Proficient Implement the method coinChangeMinCoins that returns the minimum number of coins needed for an amount. Solved
Array Prefix Sum Dynamic Programming Intermediate Implement the method maxSubarraySum that returns the largest sum of any contiguous subarray. Solved