msb-public
/
tech-interview-handbook
mirror of https://github.com/yangshun/tech-interview-handbook
2
1
Code Issues Projects Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'f891bc30c7'
${ noResults }
tech-interview-handbook/contents/algorithms/stack.md

644 B
Raw Blame History

id title
stack Stack

More questions

  • Implementation of an interpreter for a small language that does multiplication/addition/etc.
  • Design a MinStack data structure that supports a min() operation that returns the minimum value in the stack in O(1) time.
  • Write an algorithm to determine if all of the delimiters in an expression are matched and closed.
    • E.g. {ac[bb]}, [dklf(df(kl))d]{} and {[[[]]]} are matched. But {3234[fd and {df][d} are not.
    • Source
  • Sort a stack in ascending order using an additional stack.