1Remove BoxesHardArrayDynamic ProgrammingMemoization
Solve → 2Remove BoxesHardArrayDynamic ProgrammingMemoization
Solve → 3Remove BoxesHardArrayDynamic ProgrammingMemoization
Solve → 4Double Modular ExponentiationMediumArrayMathSimulation
Solve → 5Count Submatrices with Top-Left Element and Sum Less Than kMediumArrayMatrixPrefix Sum
Solve → 6Mark Elements on Array by Performing QueriesMediumArrayHash TableSorting
Solve → 7Number of IslandsMediumArrayDepth-First SearchBreadth-First Search
Solve → 8Longest Common PrefixEasyArrayStringTrie
Solve → 9Next Greater Element IEasyArrayHash TableStack
Solve → 10Minimum Number of Days to Make m BouquetsMediumArrayBinary Search
Solve → 11Double Modular ExponentiationMediumArrayMathSimulation
Solve → 12Count Submatrices with Top-Left Element and Sum Less Than kMediumArrayMatrixPrefix Sum
Solve → 13Mark Elements on Array by Performing QueriesMediumArrayHash TableSorting
Solve → 14Number of IslandsMediumArrayDepth-First SearchBreadth-First Search
Solve → 15Longest Common PrefixEasyArrayStringTrie
Solve → 16Next Greater Element IEasyArrayHash TableStack
Solve → 17Minimum Number of Days to Make m BouquetsMediumArrayBinary Search
Solve → 18Two SumEasyArrayHash Table
Solve → 19Remove BoxesHardArrayDynamic ProgrammingMemoization
Solve →