Stack

How To: Stack

• Valid parentheses
• Longest valid parentheses
• Simplify path
• Largest rectangle in histogram [Mono Stack, DP]
• Maximal rectangle [Mono Stack, DP]
• Symmetric tree
• Evaluate reverse polish notation
• Min stack
• Binary search tree iterator [BST, Recursion]
• Basic calculator [Stack]
• Basic calculator II
• Implement queue using stacks [Two stacks]
• Verify preorder sequence in binary search tree [BST]
• Closest binary search tree value II
• Verify preorder serialization of a binary tree
• Flatten nested list iterator [Iterator]
• Mini parser
• Decode string
• Ternary expression parser
• 132 pattern
• Exclusive time of function
• Baseball game [Stack]
• Number of atoms
• Asteroid collision
• Parse Lisp expression
• Daily temperatures
• Basic calculator IV
• Basic calculator III
• Car fleet
• Score of parentheses
• Leaf-similar trees
• Maximum frequency stack [Hash]
• Online stock span
• Minimum add to make parentheses valid
• Validate stack sequences [Greedy]
• Check if word is valid after substitutions
• Next greater node in linked list [Mono Stack]
• Remove outermost parentheses
• Remove all adjacent duplicates in string
• Number of valid subarrays [Mono Stack]
• Minimum cost tree from leaf values [Mono Stack]
• Reverse substrings between each pair of parentheses
• Remove all adjacent duplicates in string II