| Number of Unique XOR Triplets I | Medium | 26.5% | 100.0% | ArrayMathBit Manipulation |
| Number of Unique XOR Triplets II | Medium | 32.4% | 100.0% | ArrayMathBit Manipulation+1 |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 100.0% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 |
| Number of Strings Which Can Be Rearranged to Contain Substring | Medium | 57.0% | 78.0% | MathDynamic ProgrammingCombinatorics |
| Making A Large Island | Hard | 56.3% | 78.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Delete and Earn | Medium | 57.1% | 78.0% | ArrayHash TableDynamic Programming |
| Painting the Walls | Hard | 48.9% | 78.0% | ArrayDynamic Programming |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 73.9% | ArrayStringDynamic Programming |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 71.1% | ArrayDynamic ProgrammingGreedy |
| Two Sum | Easy | 57.1% | 71.1% | ArrayHash Table |
| Subsequence With the Minimum Score | Hard | 33.2% | 71.1% | Two PointersStringBinary Search |
| Design Twitter | Medium | 44.2% | 71.1% | Hash TableLinked ListDesign+1 |
| Next Permutation | Medium | 44.8% | 66.3% | ArrayTwo Pointers |
| Count Subarrays With Fixed Bounds | Hard | 69.2% | 65.1% | ArrayQueueSliding Window+1 |
| Consecutive Numbers | Medium | 47.9% | 61.3% | Database |
| Beautiful Arrangement | Medium | 64.7% | 61.3% | ArrayDynamic ProgrammingBacktracking+2 |
| Minimum Time to Complete Trips | Medium | 39.6% | 61.3% | ArrayBinary Search |
| Car Pooling | Medium | 56.2% | 61.3% | ArraySortingHeap (Priority Queue)+2 |
| Jump Game | Medium | 40.5% | 61.3% | ArrayDynamic ProgrammingGreedy |
| Search Suggestions System | Medium | 65.1% | 61.3% | ArrayStringBinary Search+3 |
| Find the Longest Equal Subarray | Medium | 37.6% | 61.3% | ArrayHash TableBinary Search+1 |
| Longest Non-decreasing Subarray From Two Arrays | Medium | 31.0% | 61.3% | ArrayDynamic Programming |
| Count Complete Substrings | Hard | 29.9% | 61.3% | Hash TableStringSliding Window |
| Number of Possible Sets of Closing Branches | Hard | 50.7% | 61.3% | Bit ManipulationGraphHeap (Priority Queue)+2 |
| Minimum Degree of a Connected Trio in a Graph | Hard | 44.3% | 61.3% | Graph |
| Second Highest Salary | Medium | 46.4% | 61.3% | Database |