| Number of Strings Which Can Be Rearranged to Contain Substring | Medium | 57.0% | 100.0% | MathDynamic ProgrammingCombinatorics |
| Number of Possible Sets of Closing Branches | Hard | 50.6% | 100.0% | Bit ManipulationGraph TheoryHeap (Priority Queue)+2 |
| Count Complete Substrings | Hard | 29.9% | 100.0% | Hash TableStringSliding Window |
| Number of Unique XOR Triplets I | Medium | 26.4% | 100.0% | ArrayMathBit Manipulation |
| Number of Unique XOR Triplets II | Medium | 32.3% | 100.0% | ArrayMathBit Manipulation+1 |
| Rising Temperature | Easy | 51.0% | 87.5% | Database |
| Design Exam Scores Tracker | Medium | 43.9% | 87.5% | ArrayBinary SearchDesign+1 |
| Sum of Perfect Square Ancestors | Hard | 42.4% | 87.5% | ArrayHash TableMath+4 |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.2% | 75.0% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 75.0% | ArrayDynamic ProgrammingGreedy |
| Painting the Walls | Hard | 48.9% | 75.0% | ArrayDynamic Programming |
| Two Sum | Easy | 57.1% | 75.0% | ArrayHash Table |
| Consecutive Numbers | Medium | 47.8% | 75.0% | Database |
| Count Subarrays With Fixed Bounds | Hard | 69.3% | 75.0% | ArrayQueueSliding Window+1 |
| Minimum Time to Complete Trips | Medium | 39.6% | 75.0% | ArrayBinary Search |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 75.0% | ArrayStringDynamic Programming |
| Design Twitter | Medium | 44.2% | 75.0% | Hash TableLinked ListDesign+1 |
| Reach a Number | Medium | 44.6% | 75.0% | MathBinary Search |
| Exchange Seats | Medium | 73.8% | 75.0% | Database |
| Jump Game | Medium | 40.5% | 62.5% | ArrayDynamic ProgrammingGreedy |
| Next Permutation | Medium | 44.7% | 62.5% | ArrayTwo Pointers |
| Possible Bipartition | Medium | 52.3% | 62.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Distinct Subsequences | Hard | 51.5% | 62.5% | StringDynamic Programming |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 62.5% | ArrayBinary SearchDynamic Programming+1 |
| Delete and Earn | Medium | 57.1% | 50.0% | ArrayHash TableDynamic Programming |
| Longest Non-decreasing Subarray From Two Arrays | Medium | 31.0% | 50.0% | ArrayDynamic Programming |
| Search Suggestions System | Medium | 65.2% | 50.0% | ArrayStringBinary Search+3 |
| Second Highest Salary | Medium | 46.3% | 50.0% | Database |
| Asteroid Collision | Medium | 47.1% | 50.0% | ArrayStackSimulation |
| Number of Visible People in a Queue | Hard | 72.3% | 50.0% | ArrayStackMonotonic Stack |
| Count Binary Substrings | Easy | 70.2% | 50.0% | Two PointersString |
| Number of Islands | Medium | 63.8% | 50.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Odd Even Linked List | Medium | 62.3% | 50.0% | Linked List |
| 3Sum | Medium | 38.6% | 50.0% | ArrayTwo PointersSorting |
| Collect Coins in a Tree | Hard | 39.6% | 50.0% | ArrayTreeGraph Theory+1 |
| Find Median from Data Stream | Hard | 54.2% | 50.0% | Two PointersDesignSorting+2 |
| Split Array With Same Average | Hard | 26.8% | 50.0% | ArrayHash TableMath+3 |
| Monthly Transactions I | Medium | 58.9% | 50.0% | Database |
| Find Customer Referee | Easy | 72.6% | 50.0% | Database |
| Robot Collisions | Hard | 56.1% | 50.0% | ArrayStackSorting+1 |
| Minimum Window Substring | Hard | 46.9% | 50.0% | Hash TableStringSliding Window |
| Erect the Fence | Hard | 52.7% | 50.0% | ArrayMathGeometry |
| Max Points on a Line | Hard | 30.2% | 50.0% | ArrayHash TableMath+1 |
| Maximum Subarray | Medium | 53.0% | 50.0% | ArrayDivide and ConquerDynamic Programming |