1Minimum Operations to Form Subsequence With Target SumHardArrayGreedyBit Manipulation
Solve → 2Count the Number of Square-Free SubsetsMediumArrayMathDynamic Programming
Solve → 3Best Time to Buy and Sell StockEasyArrayDynamic Programming
Solve → 4Painting the WallsHardArrayDynamic Programming
Solve → 5Jump GameMediumArrayDynamic ProgrammingGreedy
Solve → 6Maximum Genetic Difference QueryHardArrayHash TableBit Manipulation
Solve → 7Valid SudokuMediumArrayHash TableMatrix
Solve → 8The Number of Good SubsetsHardArrayMathDynamic Programming
Solve → 9Best Time to Buy and Sell Stock IIMediumArrayDynamic ProgrammingGreedy
Solve → 10Maximum Value of an Ordered Triplet IIMediumArray
Solve → 11Sum of Remoteness of All CellsMediumArrayHash TableDepth-First Search
Solve → 12Minimum Time Visiting All PointsEasyArrayMathGeometry
Solve → 13Maximum Value of an Ordered Triplet IEasyArray
Solve → 14Minimum Cost to Buy ApplesMediumArrayGraphHeap (Priority Queue)
Solve → 15Difference Between Maximum and Minimum Price SumHardArrayDynamic ProgrammingTree
Solve → 16Make the XOR of All Segments Equal to ZeroHardArrayDynamic ProgrammingBit Manipulation
Solve → 17Queens That Can Attack the KingMediumArrayMatrixSimulation
Solve → 18Minimum XOR Sum of Two ArraysHardArrayDynamic ProgrammingBit Manipulation
Solve → 19Furthest Building You Can ReachMediumArrayGreedyHeap (Priority Queue)
Solve → 20Minimum Total Space Wasted With K Resizing OperationsMediumArrayDynamic Programming
Solve → 21Sliding Window MaximumHardArrayQueueSliding Window
Solve → 22Merge IntervalsMediumArraySorting
Solve → 23Majority ElementEasyArrayHash TableDivide and Conquer
Solve → 24Number of Submatrices That Sum to TargetHardArrayHash TableMatrix
Solve → 25Trapping Rain WaterHardArrayTwo PointersDynamic Programming
Solve → 26Search in Rotated Sorted ArrayMediumArrayBinary Search
Solve → 27Minimize the Maximum Difference of PairsMediumArrayBinary SearchDynamic Programming
Solve → 28Minimum Operations to Form Subsequence With Target SumHardArrayGreedyBit Manipulation
Solve → 29Count the Number of Square-Free SubsetsMediumArrayMathDynamic Programming
Solve → 30Maximum Genetic Difference QueryHardArrayHash TableBit Manipulation
Solve → 31Furthest Building You Can ReachMediumArrayGreedyHeap (Priority Queue)
Solve → 32Minimum Total Space Wasted With K Resizing OperationsMediumArrayDynamic Programming
Solve → 33Make the XOR of All Segments Equal to ZeroHardArrayDynamic ProgrammingBit Manipulation
Solve → 34Minimum Time Visiting All PointsEasyArrayMathGeometry
Solve → 35Minimum XOR Sum of Two ArraysHardArrayDynamic ProgrammingBit Manipulation
Solve → 36Minimum Cost to Buy ApplesMediumArrayGraphHeap (Priority Queue)
Solve → 37Queens That Can Attack the KingMediumArrayMatrixSimulation
Solve → 38Difference Between Maximum and Minimum Price SumHardArrayDynamic ProgrammingTree
Solve → 39Sum of Remoteness of All CellsMediumArrayHash TableDepth-First Search
Solve → 40Maximum Value of an Ordered Triplet IIMediumArray
Solve → 41Maximum Value of an Ordered Triplet IEasyArray
Solve → 42Best Time to Buy and Sell StockEasyArrayDynamic Programming
Solve → 43Painting the WallsHardArrayDynamic Programming
Solve → 44Jump GameMediumArrayDynamic ProgrammingGreedy
Solve → 45Number of Submatrices That Sum to TargetHardArrayHash TableMatrix
Solve → 46The Number of Good SubsetsHardArrayMathDynamic Programming
Solve → 47Valid SudokuMediumArrayHash TableMatrix
Solve → 48Best Time to Buy and Sell Stock IIMediumArrayDynamic ProgrammingGreedy
Solve → 49Merge IntervalsMediumArraySorting
Solve → 50Sliding Window MaximumHardArrayQueueSliding Window
Solve → 51Majority ElementEasyArrayHash TableDivide and Conquer
Solve → 52Trapping Rain WaterHardArrayTwo PointersDynamic Programming
Solve → 53Search in Rotated Sorted ArrayMediumArrayBinary Search
Solve → 54Minimize the Maximum Difference of PairsMediumArrayBinary SearchDynamic Programming
Solve →