| Find Beautiful Indices in the Given Array I | Medium | 40.5% | 100.0% | Two PointersStringBinary Search+3 |
| Minimum Time Difference | Medium | 62.5% | 75.0% | ArrayMathString+1 |
| LRU Cache | Medium | 46.8% | 75.0% | Hash TableLinked ListDesign+1 |
| Contains Duplicate II | Easy | 50.8% | 75.0% | ArrayHash TableSliding Window |
| Find Beautiful Indices in the Given Array II | Hard | 27.6% | 75.0% | Two PointersStringBinary Search+3 |
| Merge k Sorted Lists | Hard | 58.8% | 62.5% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Single Number | Easy | 77.3% | 62.5% | ArrayBit Manipulation |
| Contains Duplicate | Easy | 64.1% | 62.5% | ArrayHash TableSorting |
| Contains Duplicate III | Hard | 24.4% | 62.5% | ArraySliding WindowSorting+2 |
| Shortest Word Distance III | Medium | 59.4% | 62.5% | |
| Integer to English Words | Hard | 34.8% | 62.5% | MathStringRecursion |
| Range Sum Query - Immutable | Easy | 71.4% | 62.5% | ArrayDesignPrefix Sum |
| Check If It Is a Straight Line | Easy | 40.0% | 62.5% | ArrayMathGeometry |
| Maximum Size Subarray Sum Equals k | Medium | 50.8% | 62.5% | |
| Selling Pieces of Wood | Hard | 52.7% | 62.5% | ArrayDynamic ProgrammingMemoization |
| Minimum Cost Path with Edge Reversals | Medium | 61.8% | 62.5% | Graph TheoryHeap (Priority Queue)Shortest Path |
| Merge Intervals | Medium | 51.1% | 50.0% | ArraySorting |
| Accounts Merge | Medium | 60.9% | 50.0% | ArrayHash TableString+4 |
| Construct Quad Tree | Medium | 78.1% | 50.0% | ArrayDivide and ConquerTree+1 |
| Count the Number of Good Subsequences | Medium | 48.3% | 50.0% | |
| Time Based Key-Value Store | Medium | 49.7% | 50.0% | Hash TableStringBinary Search+1 |
| Smallest String With Swaps | Medium | 60.3% | 50.0% | ArrayHash TableString+4 |
| Course Schedule II | Medium | 55.0% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Shortest Word Distance II | Medium | 62.7% | 50.0% | |
| String Compression | Medium | 59.5% | 50.0% | Two PointersString |
| Find Players With Zero or One Losses | Medium | 72.4% | 37.5% | ArrayHash TableSorting+1 |
| Number of Divisible Triplet Sums | Medium | 67.6% | 37.5% | |
| Daily Temperatures | Medium | 68.3% | 37.5% | ArrayStackMonotonic Stack |
| Longest Palindromic Substring | Medium | 37.3% | 37.5% | Two PointersStringDynamic Programming |
| Maximum Length of Repeated Subarray | Medium | 51.2% | 37.5% | ArrayBinary SearchDynamic Programming+3 |