| Count Submatrices with Top-Left Element and Sum Less Than k | Medium | 58.3% | 100.0% | ArrayMatrixPrefix Sum |
| Double Modular Exponentiation | Medium | 47.9% | 100.0% | ArrayMathSimulation |
| Furthest Point From Origin | Easy | 65.3% | 100.0% | StringCounting |
| Mark Elements on Array by Performing Queries | Medium | 49.1% | 100.0% | ArrayHash TableSorting+2 |
| Lexicographically Smallest Generated String | Hard | 31.5% | 100.0% | StringGreedyString Matching |
| Lexicographical Numbers | Medium | 76.2% | 62.5% | Depth-First SearchTrie |
| Valid Parentheses | Easy | 43.7% | 62.5% | StringStack |
| Climbing Stairs | Easy | 53.9% | 62.5% | MathDynamic ProgrammingMemoization |
| Number of Islands | Medium | 63.8% | 62.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Second Highest Salary | Medium | 46.3% | 62.5% | Database |
| Longest Common Prefix | Easy | 47.1% | 62.5% | ArrayStringTrie |
| Next Greater Element I | Easy | 75.7% | 62.5% | ArrayHash TableStack+1 |
| Reverse Words in a String | Medium | 55.5% | 62.5% | Two PointersString |
| Minimum Number of Days to Make m Bouquets | Medium | 56.2% | 62.5% | ArrayBinary Search |