Practice of Algorithm Problems
search
Ctrlk
  • Main
  • Arraychevron-right
  • Binary Searchchevron-right
  • Stackchevron-right
    • 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
  • Heapchevron-right
  • Bit Manipulationchevron-right
  • Greedychevron-right
  • Stringchevron-right
  • Dynamic Programmingchevron-right
  • Treechevron-right
  • Linked Listchevron-right
  • Graphchevron-right
  • Backtrackingchevron-right
  • Depth-First-Search & Breadth-First-Searchchevron-right
  • Mathchevron-right
  • Designchevron-right
  • Old Interview Questionschevron-right
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

Was this helpful?

Was this helpful?