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 Two Pointers

Intermediate

Implement the `containerWithMostWaterArea` method that returns the maximum water area formed by two vertical lines.

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 Sorting Two Pointers

Intermediate

Implement the `sortColorsThreeValues` method that sorts an array containing only three possible values.

Array Sorting Two Pointers

Guru

Implement the `findMedianOfTwoSortedArraysSimple` method that returns the floor of the median after combining two sorted arrays.

Array Sorting Two Pointers

Learner

Implement the `mergeSortedWithoutDuplicates` method that merges two sorted arrays while removing duplicate values.

Array Sorting Two Pointers

Learner

Implement the `findPairWithSortedSum` method that checks whether a sorted array contains a pair with the required sum.

String Manipulation String Two Pointers

Learner

Implement the `isSubsequenceText` method that checks whether the smaller text appears as a subsequence inside the larger text.

Array Sorting Two Pointers

Learner

Implement the `mergeTwoSortedArrays` method that merges two sorted arrays into one sorted result array.

Array Hash Map Two Pointers

Intermediate

Implement the `hasPairWithExactDifference` method that checks whether any two values in the array have the required absolute difference.

Loop Array Two Pointers

Learner

Implement the `moveZerosToEndCopy` method that returns a copy of the array with all zero values moved to the end.