Review: Stack Problems Posted on January 23, 2018September 15, 2019 by braindenny The concept of stack is simple. But the problem could be tricky. It’s not difficult, but might involve lots of details. Questions Name Example Push items to stack VS push indices Leetcode: Reverse Substrings Between Each Pair of Parentheses Push items to stack VS push string Leetcode: Reverse Substrings Between Each Pair of Parentheses Different types of elements in the stack Leetcode: Number of Atoms When pushing items to stack, whether we need delayed push? Leetcode: Decode String Don’t forget to push the last token Delayed initialization Recursive deletion during pushing process Leetcode: Verify Preorder Serialization of a Binary Tree Examine whether the input string is valid Leetcode: Asteroid Collision CheatSheet: Leetcode For Code Interview See all stack problems: #stack Review: Stack ProblemsLintCode: MinimumStringLintCode: Input StreamLeetcode: Verify Preorder Serialization of a Binary TreeLeetcode: Validate Stack SequencesLeetcode: Valid ParenthesesLeetcode: Ternary Expression ParserLeetcode: Score of ParenthesesLeetcode: Remove All Adjacent Duplicates in String IILeetcode: Number of AtomsLeetcode: Minimum Add to Make Parentheses ValidLeetcode: Mini ParserLeetcode: Max StackLeetcode: Longest Valid ParenthesesLeetcode: Exclusive Time of FunctionsLeetcode: Evaluate Reverse Polish NotationLeetcode: Decoded String at IndexLeetcode: Decode StringLeetcode: Construct Binary Tree from StringLeetcode: Basic Calculator IIILeetcode: Basic CalculatorLeetcode: Baseball GameLeetcode: Asteroid CollisionLeetcode: 132 Pattern See more blog_posts. Post Views: 6