1Shortest Subarray to be Removed to Make Array SortedMediumArrayTwo PointersBinary Search
Solve → 2Merge IntervalsMediumArraySorting
Solve → 3Minimum Total Cost to Make Arrays UnequalHardArrayHash TableGreedy
Solve → 4Most Beautiful Item for Each QueryMediumArrayBinary SearchSorting
Solve → 5Two Best Non-Overlapping EventsMediumArrayBinary SearchDynamic Programming
Solve → 6Container With Most WaterMediumArrayTwo PointersGreedy
Solve → 7Rotate ArrayMediumArrayMathTwo Pointers
Solve → 8Minimum Total Cost to Make Arrays UnequalHardArrayHash TableGreedy
Solve → 9Two Best Non-Overlapping EventsMediumArrayBinary SearchDynamic Programming
Solve → 10Most Beautiful Item for Each QueryMediumArrayBinary SearchSorting
Solve → 11Shortest Subarray to be Removed to Make Array SortedMediumArrayTwo PointersBinary Search
Solve → 12Merge IntervalsMediumArraySorting
Solve → 13Container With Most WaterMediumArrayTwo PointersGreedy
Solve → 14Rotate ArrayMediumArrayMathTwo Pointers
Solve →