1Maximum Points After Enemy BattlesMediumArrayGreedy
Solve → 2Maximize Subarray Sum After Removing All Occurrences of One ElementHardArrayHash TableDivide and Conquer
Solve → 3Find X Value of Array IIHardArrayMathSegment Tree
Solve → 4Find X Value of Array IMediumArrayMathDynamic Programming
Solve → 5Count Lattice Points Inside a CircleMediumArrayHash TableMath
Solve → 6Stamping the GridHardArrayGreedyMatrix
Solve → 7Task SchedulerMediumArrayHash TableGreedy
Solve → 8Snapshot ArrayMediumArrayHash TableBinary Search
Solve → 9Next PermutationMediumArrayTwo Pointers
Solve → 10Candy CrushMediumArrayTwo PointersMatrix
Solve → 11Task Scheduler IIMediumArrayHash TableSimulation
Solve → 12Insert Delete GetRandom O(1)MediumArrayHash TableMath
Solve → 13Random Pick with WeightMediumArrayMathBinary Search
Solve → 14Find the Sum of Subsequence PowersHardArrayDynamic ProgrammingSorting
Solve → 15Cherry Pickup IIHardArrayDynamic ProgrammingMatrix
Solve → 164SumMediumArrayTwo PointersSorting
Solve → 17Design Memory AllocatorMediumArrayHash TableDesign
Solve → 18Design Circular QueueMediumArrayLinked ListDesign
Solve → 19Maximum Points After Enemy BattlesMediumArrayGreedy
Solve → 20Maximize Subarray Sum After Removing All Occurrences of One ElementHardArrayHash TableDivide and Conquer
Solve → 21Count Lattice Points Inside a CircleMediumArrayHash TableMath
Solve → 22Stamping the GridHardArrayGreedyMatrix
Solve → 23Candy CrushMediumArrayTwo PointersMatrix
Solve → 24Find the Sum of Subsequence PowersHardArrayDynamic ProgrammingSorting
Solve → 25Random Pick with WeightMediumArrayMathBinary Search
Solve → 26Find X Value of Array IIHardArrayMathSegment Tree
Solve → 27Find X Value of Array IMediumArrayMathDynamic Programming
Solve → 28Task SchedulerMediumArrayHash TableGreedy
Solve → 29Snapshot ArrayMediumArrayHash TableBinary Search
Solve → 30Next PermutationMediumArrayTwo Pointers
Solve → 31Task Scheduler IIMediumArrayHash TableSimulation
Solve → 324SumMediumArrayTwo PointersSorting
Solve → 33Insert Delete GetRandom O(1)MediumArrayHash TableMath
Solve → 34Cherry Pickup IIHardArrayDynamic ProgrammingMatrix
Solve → 35Design Memory AllocatorMediumArrayHash TableDesign
Solve → 36Design Circular QueueMediumArrayLinked ListDesign
Solve → 37Count Zero Request ServersMediumArrayHash TableSliding Window
Solve → 38Smallest String With SwapsMediumArrayHash TableString
Solve →