20. Valid Parentheses |
Go |
Easy |
O(log n) |
O(1) |
|
42. Trapping Rain Water |
Go |
Hard |
O(n) |
O(1) |
❤️ |
71. Simplify Path |
Go |
Medium |
O(n) |
O(n) |
❤️ |
84. Largest Rectangle in Histogram |
Go |
Medium |
O(n) |
O(n) |
❤️ |
94. Binary Tree Inorder Traversal |
Go |
Medium |
O(n) |
O(1) |
|
103. Binary Tree Zigzag Level Order Traversal |
Go |
Medium |
O(n) |
O(n) |
|
144. Binary Tree Preorder Traversal |
Go |
Medium |
O(n) |
O(1) |
|
145. Binary Tree Postorder Traversal |
Go |
Hard |
O(n) |
O(1) |
|
150. Evaluate Reverse Polish Notation |
Go |
Medium |
O(n) |
O(1) |
|
155. Min Stack |
Go |
Easy |
O(n) |
O(n) |
|
173. Binary Search Tree Iterator |
Go |
Medium |
O(n) |
O(1) |
|
224. Basic Calculator |
Go |
Hard |
O(n) |
O(n) |
|
225. Implement Stack using Queues |
Go |
Easy |
O(n) |
O(n) |
|
232. Implement Queue using Stacks |
Go |
Easy |
O(n) |
O(n) |
|
331. Verify Preorder Serialization of a Binary Tree |
Go |
Medium |
O(n) |
O(1) |
|
394. Decode String |
Go |
Medium |
O(n) |
O(n) |
|
402. Remove K Digits |
Go |
Medium |
O(n) |
O(1) |
|
456. 132 Pattern |
Go |
Medium |
O(n) |
O(n) |
|
496. Next Greater Element I |
Go |
Easy |
O(n) |
O(n) |
|
503. Next Greater Element II |
Go |
Medium |
O(n) |
O(n) |
|
636. Exclusive Time of Functions |
Go |
Medium |
O(n) |
O(n) |
|
682. Baseball Game |
Go |
Easy |
O(n) |
O(n) |
|
726. Number of Atoms |
Go |
Hard |
O(n) |
O(n) |
❤️ |
735. Asteroid Collision |
Go |
Medium |
O(n) |
O(n) |
|
739. Daily Temperatures |
Go |
Medium |
O(n) |
O(n) |
|
844. Backspace String Compare |
Go |
Easy |
O(n) |
O(n) |
|
856. Score of Parentheses |
Go |
Medium |
O(n) |
O(n) |
|
880. Decoded String at Index |
Go |
Medium |
O(n) |
O(n) |
|
895. Maximum Frequency Stack |
Go |
Hard |
O(n) |
O(n) |
|
901. Online Stock Span |
Go |
Medium |
O(n) |
O(n) |
|
907. Sum of Subarray Minimums |
Go |
Medium |
O(n) |
O(n) |
❤️ |
921. Minimum Add to Make Parentheses Valid |
Go |
Medium |
O(n) |
O(n) |
|
946. Validate Stack Sequences |
Go |
Medium |
O(n) |
O(n) |
|
1003. Check If Word Is Valid After Substitutions |
Go |
Medium |
O(n) |
O(1) |
|
1019. Next Greater Node In Linked List |
Go |
Medium |
O(n) |
O(1) |
|
1021. Remove Outermost Parentheses |
Go |
Medium |
O(n) |
O(1) |
|
1047. Remove All Adjacent Duplicates In String |
Go |
Medium |
O(n) |
O(1) |