0020 | Valid Parentheses | Go | Easy | O(log n) | O(1) | | 40.2% |
0032 | Longest Valid Parentheses | Go | Hard | | | | 32.8% |
0042 | Trapping Rain Water | Go | Hard | O(n) | O(1) | ❤️ | 59.2% |
0071 | Simplify Path | Go | Medium | O(n) | O(n) | ❤️ | 39.3% |
0084 | Largest Rectangle in Histogram | Go | Hard | O(n) | O(n) | ❤️ | 42.6% |
0094 | Binary Tree Inorder Traversal | Go | Easy | O(n) | O(1) | | 73.8% |
0114 | Flatten Binary Tree to Linked List | Go | Medium | | | | 61.8% |
0143 | Reorder List | Go | Medium | | | | 52.5% |
0144 | Binary Tree Preorder Traversal | Go | Easy | O(n) | O(1) | | 66.8% |
0145 | Binary Tree Postorder Traversal | Go | Easy | O(n) | O(1) | | 67.9% |
0150 | Evaluate Reverse Polish Notation | Go | Medium | O(n) | O(1) | | 45.7% |
0155 | Min Stack | Go | Medium | O(n) | O(n) | | 52.3% |
0173 | Binary Search Tree Iterator | Go | Medium | O(n) | O(1) | | 69.7% |
0224 | Basic Calculator | Go | Hard | O(n) | O(n) | | 42.4% |
0225 | Implement Stack using Queues | Go | Easy | O(n) | O(n) | | 58.6% |
0227 | Basic Calculator II | Go | Medium | | | | 42.4% |
0232 | Implement Queue using Stacks | Go | Easy | O(n) | O(n) | | 63.2% |
0234 | Palindrome Linked List | Go | Easy | | | | 50.2% |
0331 | Verify Preorder Serialization of a Binary Tree | Go | Medium | O(n) | O(1) | | 44.6% |
0341 | Flatten Nested List Iterator | Go | Medium | | | | 61.8% |
0385 | Mini Parser | Go | Medium | | | | 36.9% |
0394 | Decode String | Go | Medium | O(n) | O(n) | | 57.9% |
0402 | Remove K Digits | Go | Medium | O(n) | O(1) | | 30.6% |
0445 | Add Two Numbers II | Go | Medium | | | | 59.6% |
0456 | 132 Pattern | Go | Medium | O(n) | O(n) | | 32.4% |
0496 | Next Greater Element I | Go | Easy | O(n) | O(n) | | 71.4% |
0503 | Next Greater Element II | Go | Medium | O(n) | O(n) | | 63.2% |
0581 | Shortest Unsorted Continuous Subarray | Go | Medium | | | | 36.4% |
0589 | N-ary Tree Preorder Traversal | Go | Easy | | | | 75.9% |
0636 | Exclusive Time of Functions | Go | Medium | O(n) | O(n) | | 61.2% |
0682 | Baseball Game | Go | Easy | O(n) | O(n) | | 74.3% |
0726 | Number of Atoms | Go | Hard | O(n) | O(n) | ❤️ | 52.1% |
0735 | Asteroid Collision | Go | Medium | O(n) | O(n) | | 44.4% |
0739 | Daily Temperatures | Go | Medium | O(n) | O(n) | | 66.3% |
0844 | Backspace String Compare | Go | Easy | O(n) | O(n) | | 48.1% |
0853 | Car Fleet | Go | Medium | | | | 50.3% |
0856 | Score of Parentheses | Go | Medium | O(n) | O(n) | | 64.8% |
0880 | Decoded String at Index | Go | Medium | O(n) | O(n) | | 28.3% |
0895 | Maximum Frequency Stack | Go | Hard | O(n) | O(n) | | 66.6% |
0897 | Increasing Order Search Tree | Go | Easy | | | | 78.4% |
0901 | Online Stock Span | Go | Medium | O(n) | O(n) | | 65.2% |
0907 | Sum of Subarray Minimums | Go | Medium | O(n) | O(n) | ❤️ | 35.8% |
0921 | Minimum Add to Make Parentheses Valid | Go | Medium | O(n) | O(n) | | 75.8% |
0946 | Validate Stack Sequences | Go | Medium | O(n) | O(n) | | 67.7% |
1003 | Check If Word Is Valid After Substitutions | Go | Medium | O(n) | O(1) | | 58.2% |
1006 | Clumsy Factorial | Go | Medium | | | | 55.4% |
1019 | Next Greater Node In Linked List | Go | Medium | O(n) | O(1) | | 59.9% |
1021 | Remove Outermost Parentheses | Go | Easy | O(n) | O(1) | | 80.6% |
1047 | Remove All Adjacent Duplicates In String | Go | Easy | O(n) | O(1) | | 69.7% |
1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | Go | Medium | | | | 73.0% |
1190 | Reverse Substrings Between Each Pair of Parentheses | Go | Medium | | | | 65.9% |
1209 | Remove All Adjacent Duplicates in String II | Go | Medium | | | | 56.2% |
1249 | Minimum Remove to Make Valid Parentheses | Go | Medium | | | | 65.8% |
1614 | Maximum Nesting Depth of the Parentheses | Go | Easy | | | | 82.3% |
1653 | Minimum Deletions to Make String Balanced | Go | Medium | | | | 58.9% |
1673 | Find the Most Competitive Subsequence | Go | Medium | | | | 49.3% |
1700 | Number of Students Unable to Eat Lunch | Go | Easy | | | | 68.7% |
———— | ——————————————————- | ——- | —————- | ————— | ————- | ————- | ————- |