Practice of Algorithm Problems
search
⌘Ctrlk
Practice of Algorithm Problems
  • Main
  • Array
  • Binary Search
  • Stack
    • 20. Valid Parentheses
    • 71. Simplify Path
    • 84. Largest Rectangle in Histogram
    • 150. Evaluate Reverse Polish Notation
    • 224. Basic Calculator
    • 227. Basic Calculator II
    • 456. 132 Pattern
    • 496. Next Greater Element I
    • 503. Next Greater Element II
    • 636. Exclusive Time of Functions
    • 726. Number of Atoms
    • 735. Asteroid Collision
    • 1130. Minimum Cost Tree From Leaf Values
    • 1190. Reverse Substrings Between Each Pair of Parentheses
  • Heap
  • Bit Manipulation
  • Greedy
  • String
  • Dynamic Programming
  • Tree
  • Linked List
  • Graph
  • Backtracking
  • Depth-First-Search & Breadth-First-Search
  • Math
  • Design
  • Old Interview Questions
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Stack

20. Valid Parentheseschevron-right71. Simplify Pathchevron-right84. Largest Rectangle in Histogramchevron-right150. Evaluate Reverse Polish Notationchevron-right224. Basic Calculatorchevron-right227. Basic Calculator IIchevron-right456. 132 Patternchevron-right496. Next Greater Element Ichevron-right503. Next Greater Element IIchevron-right636. Exclusive Time of Functionschevron-right726. Number of Atomschevron-right735. Asteroid Collisionchevron-right1130. Minimum Cost Tree From Leaf Valueschevron-right1190. Reverse Substrings Between Each Pair of Parentheseschevron-right
Previous1231. Divide Chocolatechevron-leftNext20. Valid Parentheseschevron-right

Last updated 6 years ago