Math Dynamic Programming Matrix Tabulation Learner Implement the uniquePathsInGrid method that counts paths from the top-left cell to the bottom-right cell in a grid. Solved
Array Dynamic Programming Matrix Tabulation Intermediate Implement the minimumPathSumGrid method that finds the minimum path sum from the top-left to the bottom-right of a grid. Solved
Array Dynamic Programming Matrix Tabulation Intermediate Implement the maximumPathSumGrid method that finds the maximum path sum from the top-left to the bottom-right of a grid. Solved
Array Dynamic Programming Tabulation Proficient Implement the countSubsetSumWays method that counts how many subsets produce the target sum. Solved
Array Dynamic Programming Tabulation Intermediate Implement the subsetSumExists method that checks whether any subset can produce the target sum. Solved
Array Dynamic Programming Tabulation Proficient Implement the canPartitionEqualSum method that checks whether the array can be split into two subsets with equal sum. Solved
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