| Largest Rectangle in Histogram | Hard | 49.4% |
| Maximum Width Ramp | Medium | 55.8% |
| Valid Parentheses | Easy | 43.7% |
| Next Greater Element I | Easy | 75.8% |
| Daily Temperatures | Medium | 68.4% |
| Remove K Digits | Medium | 36.4% |
| Trapping Rain Water | Hard | 66.8% |
| Longest Valid Parentheses | Hard | 38.1% |
| Sum of Subarray Minimums | Medium | 38.3% |
| Asteroid Collision | Medium | 47.2% |
| Create Maximum Number | Hard | 34.7% |
| Decode String | Medium | 62.3% |
| Flatten Nested List Iterator | Medium | 65.6% |
| Basic Calculator II | Medium | 46.7% |
| Min Stack | Medium | 57.7% |
| Binary Search Tree Iterator | Medium | 76.2% |
| Reverse Substrings Between Each Pair of Parentheses | Medium | 71.9% |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% |
| Basic Calculator | Hard | 46.6% |
| Parsing A Boolean Expression | Hard | 69.8% |
| Parse Lisp Expression | Hard | 53.5% |
| Number of Atoms | Hard | 65.1% |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% |
| Backspace String Compare | Easy | 49.8% |
| Mini Parser | Medium | 42.0% |
| Valid Parenthesis String | Medium | 39.8% |
| Binary Tree Inorder Traversal | Easy | 79.7% |
| Sum of Total Strength of Wizards | Hard | 29.2% |
| Remove Outermost Parentheses | Easy | 86.9% |
| Palindrome Linked List | Easy | 57.5% |
| Next Greater Element II | Medium | 67.9% |
| Reorder List | Medium | 64.6% |
| Binary Tree Preorder Traversal | Easy | 75.2% |
| Maximal Rectangle | Hard | 58.1% |
| Construct Binary Search Tree from Preorder Traversal | Medium | 84.1% |
| Number of Students Unable to Eat Lunch | Easy | 79.4% |
| Robot Collisions | Hard | 56.1% |
| Car Fleet | Medium | 54.8% |
| Implement Queue using Stacks | Easy | 69.4% |
| Maximum Nesting Depth of the Parentheses | Easy | 84.8% |
| Evaluate Reverse Polish Notation | Medium | 57.1% |
| Online Stock Span | Medium | 68.7% |
| 132 Pattern | Medium | 34.5% |
| Exclusive Time of Functions | Medium | 66.1% |
| Flatten Binary Tree to Linked List | Medium | 70.2% |
| Remove All Adjacent Duplicates In String | Easy | 72.8% |
| Implement Stack using Queues | Easy | 69.4% |
| Final Prices With a Special Discount in a Shop | Easy | 84.0% |
| Design Browser History | Medium | 78.2% |
| Remove Duplicate Letters | Medium | 52.8% |
| Maximum Subarray Min-Product | Medium | 40.0% |
| Simplify Path | Medium | 50.0% |
| Minimum Add to Make Parentheses Valid | Medium | 74.4% |
| Number of Visible People in a Queue | Hard | 72.4% |
| Shortest Subarray to be Removed to Make Array Sorted | Medium | 51.3% |
| Maximum Frequency Stack | Hard | 66.6% |
| Minimum Deletions to Make String Balanced | Medium | 68.2% |
| Remove All Occurrences of a Substring | Medium | 78.4% |
| Maximum Twin Sum of a Linked List | Medium | 81.6% |
| Remove Nodes From Linked List | Medium | 74.8% |
| Sum of Subarray Ranges | Medium | 60.8% |
| Max Stack | Hard | 45.9% |
| Removing Stars From a String | Medium | 79.0% |
| Max Chunks To Make Sorted | Medium | 64.1% |
| Smallest Subsequence of Distinct Characters | Medium | 63.1% |
| Binary Tree Postorder Traversal | Easy | 77.6% |
| Baseball Game | Easy | 80.1% |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% |
| Maximum Number of Books You Can Take | Hard | 39.5% |
| Using a Robot to Print the Lexicographically Smallest String | Medium | 62.5% |
| Clear Digits | Easy | 82.7% |
| Lexicographically Minimum String After Removing Stars | Medium | 51.0% |
| Add Two Numbers II | Medium | 62.4% |
| Basic Calculator III | Hard | 53.2% |
| Buildings With an Ocean View | Medium | 80.9% |
| Check if a Parentheses String Can Be Valid | Medium | 45.1% |
| Count Bowl Subarrays | Medium | 47.9% |
| Next Greater Node In Linked List | Medium | 63.9% |
| Design an Expression Tree With Evaluate Function | Medium | 82.5% |
| Construct Smallest Number From DI String | Medium | 85.6% |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% |
| Design a Stack With Increment Operation | Medium | 79.9% |
| N-ary Tree Postorder Traversal | Easy | 81.0% |
| Maximum Balanced Shipments | Medium | 61.3% |
| Increasing Order Search Tree | Easy | 78.9% |
| Validate Stack Sequences | Medium | 70.2% |
| Find Maximum Non-decreasing Array Length | Hard | 18.5% |
| Reverse Prefix of Word | Easy | 86.5% |
| Design a Text Editor | Hard | 50.1% |
| Minimum String Length After Removing Substrings | Easy | 77.1% |
| Max Chunks To Make Sorted II | Hard | 54.7% |
| Count Submatrices With All Ones | Medium | 71.1% |
| Minimum Operations to Convert All Elements to Zero | Medium | 53.0% |
| Make The String Great | Easy | 68.4% |
| Two Sum BSTs | Medium | 68.2% |
| Replace Non-Coprime Numbers in Array | Hard | 57.7% |
| Double a Number Represented as a Linked List | Medium | 61.3% |
| Dinner Plate Stacks | Hard | 33.5% |
| Find Building Where Alice and Bob Can Meet | Hard | 52.2% |