Code Challenges

Get better at coding with practice problems.

Coding Challenges

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

Start with beginner challenges

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.

Array Sorting Binary Search Two Pointers

Proficient

Implement the `aggressiveCowsDistance` method that maximizes the minimum distance between placed cows.

Array Sorting Binary Search Two Pointers

Proficient

Implement the `allocateMinimumPagesSimple` method that minimizes the maximum pages assigned to any student.

Array Sorting Binary Search Two Pointers

Intermediate

Implement the `findPeakUsingBinarySearch` method that returns a peak element index using binary search.

Array Sorting Binary Search Two Pointers

Intermediate

Implement the `sortColorsOnePass` method that sorts three color values in one pass.

Array Sorting Binary Search Two Pointers

Proficient

Implement the `medianTwoSortedArraysFloor` method that returns the floor of the median of two sorted arrays.

Array Sorting Binary Search Two Pointers

Intermediate

Implement the `findMinimumRotatedSorted` method that returns the minimum value from a rotated sorted array.

Array Sorting Binary Search Two Pointers

Proficient

Implement the `mergeSortInversionCount` method that counts inversions using merge-sort style processing.

Array Sorting Binary Search Two Pointers

Intermediate

Implement the `kthLargestQuickSelect` method that returns the kth largest value using selection logic.

Array Sorting Binary Search Two Pointers

Intermediate

Implement the `firstAndLastPositionBinary` method that returns the first and last target positions using binary search.

Array Sorting Binary Search Two Pointers

Intermediate

Implement the `searchRotatedSortedArrayImportant` method that searches for a target in a rotated sorted array using binary search.