Code Challenges

Get better at coding with practice problems.

Coding Challenges

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

Array Sorting Binary Search

Proficient

Implement the `shipPackagesWithinDaysCapacity` method that returns the minimum ship capacity needed to deliver packages within given days.

Array Sorting Binary Search

Intermediate

Implement the `smallestDivisorUnderThreshold` method that finds the smallest divisor satisfying a threshold condition.

Array Sorting Binary Search

Intermediate

Implement the `kthMissingPositiveNumber` method that returns the kth missing positive integer from a sorted array.

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.

Array Counting Binary Search

Intermediate

Implement the `searchRangeOfTarget` method that returns the first and last position of a target in a sorted array.

Array Binary Search

Intermediate

Implement the `findRotationCount` method that returns how many times a sorted array has been rotated.

Array Binary Search

Intermediate

Implement the `searchInRotatedSortedArray` method that searches for a target inside a rotated sorted array.

Array Decision Making Binary Search

Intermediate

Implement the `findPeakElementIndex` method that returns an index of a peak element in the array.

Array Binary Search

Intermediate

Implement the `findFirstGreaterThanTarget` method that returns the first value greater than the target in a sorted array.

Array Binary Search

Learner

Implement the `findInsertPosition` method that returns the index where the target should be inserted in sorted order.