Practice of Algorithm Problems
Ctrlk
  • 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
Powered by GitBook
On this page

Was this helpful?

Stack

20. Valid Parentheses71. Simplify Path84. Largest Rectangle in Histogram150. Evaluate Reverse Polish Notation224. Basic Calculator227. Basic Calculator II456. 132 Pattern496. Next Greater Element I503. Next Greater Element II636. Exclusive Time of Functions726. Number of Atoms735. Asteroid Collision1130. Minimum Cost Tree From Leaf Values1190. Reverse Substrings Between Each Pair of Parentheses
Previous1231. Divide ChocolateNext20. Valid Parentheses

Last updated 6 years ago

Was this helpful?