| 20 | Valid Parentheses | — | Easy | StringStack | 42% | |
| 32 | Longest Valid Parentheses | — | Hard | StringDynamic ProgrammingStack | 36% | |
| 42 | Trapping Rain Water | — | Hard | ArrayTwo PointersDynamic Programming | 65% | |
| 71 | Simplify Path | — | Medium | StringStack | 47% | |
| 84 | Largest Rectangle in Histogram | — | Hard | ArrayStackMonotonic Stack | 47% | |
| 85 | Maximal Rectangle | — | Hard | ArrayDynamic ProgrammingStack | 53% | |
| 94 | Binary Tree Inorder Traversal | — | Easy | StackTreeDepth-First Search | 78% | |
| 114 | Flatten Binary Tree to Linked List | — | Medium | Linked ListStackTree | 68% | |
| 143 | Reorder List | — | Medium | Linked ListTwo PointersStack | 62% | |
| 144 | Binary Tree Preorder Traversal | — | Easy | StackTreeDepth-First Search | 73% | |
| 145 | Binary Tree Postorder Traversal | — | Easy | StackTreeDepth-First Search | 75% | |
| 150 | Evaluate Reverse Polish Notation | — | Medium | ArrayMathStack | 55% | |
| 155 | Min Stack | — | Medium | StackDesign | 56% | |
| 173 | Binary Search Tree Iteratorread | — | Medium | StackTreeDesign | 75% | |
| 224 | Basic Calculator | — | Hard | MathStringStack | 45% | |
| 225 | Implement Stack using Queues | — | Easy | StackDesignQueue | 67% | |
| 227 | Basic Calculator II | — | Medium | MathStringStack | 46% | |
| 232 | Implement Queue using Stacks | — | Easy | StackDesignQueue | 68% | |
| 234 | Palindrome Linked List | — | Easy | Linked ListTwo PointersStack | 56% | |
| 316 | Remove Duplicate Letters | — | Medium | StringStackGreedy | 51% | |
| 321 | Create Maximum Number | — | Hard | ArrayTwo PointersStack | 32% | |
| 331 | Verify Preorder Serialization of a Binary Tree | — | Medium | StringStackTree | 46% | |
| 341 | Flatten Nested List Iteratorread | — | Medium | StackTreeDepth-First Search | 65% | |
| 385 | Mini Parserread | — | Medium | StringStackDepth-First Search | 40% | |
| 388 | Longest Absolute File Path | — | Medium | StringStackDepth-First Search | 48% | |
| 394 | Decode String | — | Medium | StringStackRecursion | 61% | |
| 402 | Remove K Digits | — | Medium | StringStackGreedy | 35% | |
| 445 | Add Two Numbers II | — | Medium | Linked ListMathStack | 62% | |
| 456 | 132 Pattern | — | Medium | ArrayBinary SearchStack | 34% | |
| 488 | Zuma Game | — | Hard | StringDynamic ProgrammingStack | 32% | |
| 496 | Next Greater Element I | — | Easy | ArrayHash TableStack | 74% | |
| 503 | Next Greater Element II | — | Medium | ArrayStackMonotonic Stack | 66% | |
| 581 | Shortest Unsorted Continuous Subarray | — | Medium | ArrayTwo PointersStack | 37% | |
| 589 | N-ary Tree Preorder Traversal | — | Easy | StackTreeDepth-First Search | 76% | |
| 590 | N-ary Tree Postorder Traversal | — | Easy | StackTreeDepth-First Search | 81% | |
| 591 | Tag Validator | — | Hard | StringStack | 39% | |
| 636 | Exclusive Time of Functions | — | Medium | ArrayStack | 65% | |
| 654 | Maximum Binary Tree | — | Medium | ArrayDivide and ConquerStack | 86% | |
| 678 | Valid Parenthesis String | — | Medium | StringDynamic ProgrammingStack | 39% | |
| 682 | Baseball Game | — | Easy | ArrayStackSimulation | 79% | |
| 726 | Number of Atoms | — | Hard | Hash TableStringStack | 65% | |
| 735 | Asteroid Collision | — | Medium | ArrayStackSimulation | 45% | |
| 736 | Parse Lisp Expression | — | Hard | Hash TableStringStack | 53% | |
| 739 | Daily Temperatures | — | Medium | ArrayStackMonotonic Stack | 67% | |
| 768 | Max Chunks To Make Sorted II | — | Hard | ArrayStackGreedy | 54% | |
| 770 | Basic Calculator IV | — | Hard | Hash TableMathString | 49% | |
| 844 | Backspace String Compareread | — | Easy | Two PointersStringStack | 49% | |
| 853 | Car Fleet | — | Medium | ArrayStackSorting | 53% | |
| 856 | Score of Parentheses | — | Medium | StringStack | 64% | |
| 880 | Decoded String at Index | — | Medium | StringStack | 37% | |