| Minimum Operations to Form Subsequence With Target Sum | Hard | 32.4% | 100.0% | ArrayGreedyBit Manipulation |
| Count the Number of Square-Free Subsets | Medium | 26.4% | 92.9% | ArrayMathDynamic Programming+2 |
| Scramble String | Hard | 43.9% | 86.4% | StringDynamic Programming |
| Maximum Genetic Difference Query | Hard | 46.5% | 86.4% | ArrayHash TableBit Manipulation+2 |
| Maximum Value of an Ordered Triplet II | Medium | 56.4% | 82.4% | Array |
| Sum of Remoteness of All Cells | Medium | 70.8% | 82.4% | ArrayHash TableDepth-First Search+3 |
| Minimum Time Visiting All Points | Easy | 84.8% | 82.4% | ArrayMathGeometry |
| Maximum Value of an Ordered Triplet I | Easy | 58.2% | 82.4% | Array |
| Minimum Cost to Buy Apples | Medium | 67.3% | 82.4% | ArrayGraphHeap (Priority Queue)+1 |
| Difference Between Maximum and Minimum Price Sum | Hard | 33.3% | 82.4% | ArrayDynamic ProgrammingTree+1 |
| Make the XOR of All Segments Equal to Zero | Hard | 41.0% | 82.4% | ArrayDynamic ProgrammingBit Manipulation |
| Queens That Can Attack the King | Medium | 72.6% | 82.4% | ArrayMatrixSimulation |
| Maximum XOR of Two Non-Overlapping Subtrees | Hard | 52.1% | 82.4% | TreeDepth-First SearchGraph+1 |
| Minimum XOR Sum of Two Arrays | Hard | 50.6% | 82.4% | ArrayDynamic ProgrammingBit Manipulation+1 |
| Furthest Building You Can Reach | Medium | 50.7% | 82.4% | ArrayGreedyHeap (Priority Queue) |
| Minimum Total Space Wasted With K Resizing Operations | Medium | 43.9% | 82.4% | ArrayDynamic Programming |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 77.4% | ArrayDynamic Programming |
| Flatten Binary Tree to Linked List | Medium | 70.2% | 74.4% | Linked ListStackTree+2 |
| Substring with Concatenation of All Words | Hard | 34.0% | 74.4% | Hash TableStringSliding Window |
| Merge Two Sorted Lists | Easy | 68.0% | 70.9% | Linked ListRecursion |
| Painting the Walls | Hard | 48.9% | 66.9% | ArrayDynamic Programming |
| Jump Game | Medium | 40.5% | 61.9% | ArrayDynamic ProgrammingGreedy |
| Fizz Buzz | Easy | 75.3% | 61.9% | MathStringSimulation |
| Valid Sudoku | Medium | 64.2% | 55.5% | ArrayHash TableMatrix |
| The Number of Good Subsets | Hard | 37.1% | 55.5% | ArrayMathDynamic Programming+2 |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 55.5% | ArrayDynamic ProgrammingGreedy |
| LRU Cache | Medium | 46.8% | 55.5% | Hash TableLinked ListDesign+1 |
| Binary Search Tree Iterator | Medium | 76.2% | 55.5% | StackTreeDesign+3 |
| Valid Phone Numbers | Easy | 29.0% | 55.5% | Shell |
| Number of Submatrices That Sum to Target | Hard | 74.6% | 55.5% | ArrayHash TableMatrix+1 |
| Longest Palindromic Substring | Medium | 37.4% | 46.5% | Two PointersStringDynamic Programming |
| Sum of Distances in Tree | Hard | 65.5% | 46.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Sliding Window Maximum | Hard | 48.5% | 46.5% | ArrayQueueSliding Window+2 |
| Merge Intervals | Medium | 51.2% | 46.5% | ArraySorting |
| All O`one Data Structure | Hard | 44.2% | 46.5% | Hash TableLinked ListDesign+1 |
| Majority Element | Easy | 66.1% | 46.5% | ArrayHash TableDivide and Conquer+2 |
| Trapping Rain Water | Hard | 66.8% | 46.5% | ArrayTwo PointersDynamic Programming+2 |
| Search in Rotated Sorted Array | Medium | 44.1% | 46.5% | ArrayBinary Search |
| Minimize the Maximum Difference of Pairs | Medium | 50.9% | 46.5% | ArrayBinary SearchDynamic Programming+2 |
