Review: Stack Problems Posted on January 23, 2018February 3, 2020 by braindenny The concept of stack is simple. But the problem could be tricky. It’s not difficult, but might involve lots of details. Basic Abstractions Name Summary 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 Don’t forget to push the last segment Delayed initialization Questions Num Problem Summary 1 Recursive deletion during pushing process LeetCode: Verify Preorder Serialization of a Binary Tree 2 Examine whether the input string is valid LeetCode: Asteroid Collision 3 When pushing to stack, whether delayed push LeetCode: Decode String CheatSheet: Leetcode For Code Interview CheatSheet: Common Code Problems & Follow-ups 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: Reverse Substrings Between Each Pair of ParenthesesLeetcode: Remove All Adjacent Duplicates in String II See more blog posts. Post Views: 6