Code Challenges

Get better at coding with practice problems.

Coding Challenges

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

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.

Array String Dynamic Programming Memoization Tabulation

Intermediate

Implement the `houseRobberMaximumAmount` method that returns the maximum amount that can be robbed without choosing adjacent houses.

String Dynamic Programming Memoization Tabulation

Proficient

Implement the `wordBreakPossible` method that checks whether the text can be segmented using the given dictionary words.

String Dynamic Programming Tabulation

Intermediate

Implement the `decodeWaysCount` method that counts how many ways a digit string can be decoded.

Array Dynamic Programming Matrix Tabulation

Proficient

Implement the `maximumSquareOfOnes` method that returns the area of the largest square containing only 1 values.

Array Dynamic Programming Tabulation

Proficient

Implement the `minimumJumpsToReachEnd` method that finds the minimum jumps required to reach the last index.

Math Dynamic Programming Tabulation

Intermediate

Implement the `maximumProductCutting` method that finds the maximum product obtainable by cutting an integer into parts.

Array Dynamic Programming Tabulation

Proficient

Implement the `rodCuttingMaximumProfit` method that finds the maximum profit obtainable by cutting a rod into pieces.

String Dynamic Programming Tabulation

Proficient

Implement the `minimumInsertionsToPalindrome` method that finds the minimum insertions required to make the text a palindrome.

String Dynamic Programming Tabulation

Proficient

Implement the `longestPalindromicSubsequenceLength` method that returns the length of the longest palindromic subsequence.

Array Dynamic Programming Matrix Tabulation

Intermediate

Implement the `uniquePathsWithBlockedCells` method that counts grid paths while avoiding blocked cells.