1Asteroid CollisionMediumArrayStackSimulation
Solve → 2Furthest Building You Can ReachMediumArrayGreedyHeap (Priority Queue)
Solve → 3Final Prices With a Special Discount in a ShopEasyArrayStackMonotonic Stack
Solve → 4Minimum Number of Increments on Subarrays to Form a Target ArrayHardArrayDynamic ProgrammingStack
Solve → 53SumMediumArrayTwo PointersSorting
Solve → 6Partition Equal Subset SumMediumArrayDynamic Programming
Solve → 7Gas StationMediumArrayGreedy
Solve → 8Rotting OrangesMediumArrayBreadth-First SearchMatrix
Solve → 93Sum ClosestMediumArrayTwo PointersSorting
Solve → 10Minimum Falling Path SumMediumArrayDynamic ProgrammingMatrix
Solve → 11Container With Most WaterMediumArrayTwo PointersGreedy
Solve → 12Final Prices With a Special Discount in a ShopEasyArrayStackMonotonic Stack
Solve → 13Asteroid CollisionMediumArrayStackSimulation
Solve → 14Furthest Building You Can ReachMediumArrayGreedyHeap (Priority Queue)
Solve → 15Minimum Falling Path SumMediumArrayDynamic ProgrammingMatrix
Solve → 16Gas StationMediumArrayGreedy
Solve → 173SumMediumArrayTwo PointersSorting
Solve → 18Minimum Number of Increments on Subarrays to Form a Target ArrayHardArrayDynamic ProgrammingStack
Solve → 19Partition Equal Subset SumMediumArrayDynamic Programming
Solve → 20Rotting OrangesMediumArrayBreadth-First SearchMatrix
Solve → 213Sum ClosestMediumArrayTwo PointersSorting
Solve → 22Container With Most WaterMediumArrayTwo PointersGreedy
Solve →