| Maximum Points After Enemy Battles | Medium | 33.2% | 100.0% | ArrayGreedy |
| Count Lattice Points Inside a Circle | Medium | 56.5% | 75.0% | ArrayHash TableMath+2 |
| Maximize Subarray Sum After Removing All Occurrences of One Element | Hard | 22.9% | 75.0% | ArrayDynamic ProgrammingSegment Tree |
| Manhattan Distances of All Arrangements of Pieces | Hard | 35.1% | 75.0% | MathCombinatorics |
| Distribute Candies Among Children I | Easy | 76.2% | 62.5% | MathCombinatoricsEnumeration |
| Distribute Candies Among Children II | Medium | 55.7% | 62.5% | MathCombinatoricsEnumeration |
| Distribute Candies Among Children III | Hard | 57.2% | 62.5% | |
| Stamping the Grid | Hard | 34.9% | 62.5% | ArrayGreedyMatrix+1 |
| Alice and Bob Playing Flower Game | Medium | 60.1% | 62.5% | Math |
| Candy Crush | Medium | 77.3% | 62.5% | |
| Find the Sum of Subsequence Powers | Hard | 25.0% | 62.5% | ArrayDynamic ProgrammingSorting |
| Existence of a Substring in a String and Its Reverse | Easy | 66.4% | 62.5% | Hash TableString |
| Random Pick with Weight | Medium | 48.9% | 62.5% | ArrayMathBinary Search+2 |
| Find Longest Special Substring That Occurs Thrice II | Medium | 39.1% | 62.5% | Hash TableStringBinary Search+2 |
| Find X Value of Array II | Hard | 30.5% | 62.5% | ArrayMathSegment Tree |
| Find X Value of Array I | Medium | 37.1% | 62.5% | ArrayMathDynamic Programming |
| Task Scheduler | Medium | 62.6% | 50.0% | ArrayHash TableGreedy+3 |
| LRU Cache | Medium | 46.8% | 50.0% | Hash TableLinked ListDesign+1 |
| Design Add and Search Words Data Structure | Medium | 48.1% | 50.0% | StringDepth-First SearchDesign+1 |
| Web Crawler Multithreaded | Medium | 51.0% | 50.0% | |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 50.0% | ArrayHash TableMath+2 |
| Remove Invalid Parentheses | Hard | 49.8% | 50.0% | StringBacktrackingBreadth-First Search |
| Snapshot Array | Medium | 36.7% | 50.0% | ArrayHash TableBinary Search+1 |
| 4Sum | Medium | 40.0% | 37.5% | ArrayTwo PointersSorting |
| Next Permutation | Medium | 44.7% | 37.5% | ArrayTwo Pointers |
| Edit Distance | Medium | 60.1% | 37.5% | StringDynamic Programming |
| Scramble String | Hard | 43.9% | 37.5% | StringDynamic Programming |
| Design Bounded Blocking Queue | Medium | 73.6% | 37.5% | |
| Design a Text Editor | Hard | 49.9% | 37.5% | Linked ListStringStack+3 |
| Cherry Pickup II | Hard | 72.3% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Prefix and Suffix Search | Hard | 40.8% | 37.5% | ArrayHash TableString+2 |
| Web Crawler | Medium | 68.9% | 37.5% | |
| Design Memory Allocator | Medium | 49.7% | 37.5% | ArrayHash TableDesign+1 |
| Task Scheduler II | Medium | 54.7% | 37.5% | ArrayHash TableSimulation |
| Design Circular Queue | Medium | 54.0% | 37.5% | ArrayLinked ListDesign+1 |
| Special Binary String | Hard | 76.2% | 37.5% | StringDivide and ConquerSorting |
| Minimum Number of Moves to Make Palindrome | Hard | 52.6% | 37.5% | Two PointersStringGreedy+1 |