Code Challenges

Get better at coding with practice problems.

Coding Challenges

Select a problem, write code, run test cases, and submit your solution.

Math Dynamic Programming

Proficient

Implement the `stoneGameOptimalDifference` method that returns the best score difference when both players pick stones optimally.

Math Dynamic Programming

Guru

Implement the `minimumCostCutStick` method that returns the minimum total cost to cut a stick at given positions.

String Dynamic Programming Pattern Matching

Guru

Implement the `regularExpressionMatch` method that checks full string matching with dot and star pattern rules.

Math Dynamic Programming

Proficient

Implement the `distinctSubsequenceCount` method that counts how many subsequences of a source string equal a target string.

Math Dynamic Programming

Proficient

Implement the `interleavingStringCheck` method that checks whether one string is formed by interleaving two other strings.

Math Dynamic Programming

Intermediate

Implement the `minimumFlipsMonotoneBinary` method that returns the minimum flips needed to make a binary string monotone increasing.

Math Dynamic Programming

Guru

Implement the `burstBalloonsMaxCoins` method that returns the maximum coins obtainable by bursting balloons in the best order.

Math Dynamic Programming

Proficient

Implement the `maxProfitWithCooldown` method that returns the maximum stock profit with a one-day cooldown after selling.

Math Dynamic Programming

Proficient

Implement the `targetSumWaysCount` method that counts expressions that reach a target by assigning plus or minus signs.

Math Dynamic Programming

Proficient

Implement the `maximumProductSubarray` method that returns the largest product of any continuous subarray.

Array String Dynamic Programming Memoization Tabulation

Guru

Implement the `regularExpressionMatchSimple` method that checks whether text matches a simplified regular expression pattern.

Array String Dynamic Programming Memoization Tabulation

Guru

Implement the `palindromePartitionMinCuts` method that returns the minimum cuts needed to split text into palindrome parts.

Array String Dynamic Programming Memoization Tabulation

Proficient

Implement the `maximumSquareAreaOnes` method that returns the area of the largest all-ones square in a matrix.

Array String Dynamic Programming Memoization Tabulation

Proficient

Implement the `wordBreakDpPossible` method that checks whether dynamic programming can segment the text into dictionary words.

Array String Dynamic Programming Memoization Tabulation

Guru

Implement the `editDistanceDpOperations` method that returns the minimum edit operations using dynamic programming.

Array String Dynamic Programming Memoization Tabulation

Proficient

Implement the `longestCommonSubsequenceDpLength` method that returns the LCS length using dynamic programming.

Array String Dynamic Programming Memoization Tabulation

Proficient

Implement the `longestIncreasingSubsequenceOptimizedLength` method that returns the LIS length using optimized binary-search based logic.

Array String Dynamic Programming Memoization Tabulation

Intermediate

Implement the `coinChangeCombinationCount` method that counts coin combinations that can make the amount.

Array String Dynamic Programming Memoization Tabulation

Proficient

Implement the `coinChangeMinimumCoins` method that returns the minimum number of coins needed to make the amount.