Agenda

• [ ] 랭킹 기능 리뷰
• [ ] 알고리즘 문제 풀기

What I Learned

• Stack
  • It is a data structure. Last-in-First-out!
  • peek(): returns element at the top
  • pop(): returns element at the top & removes it
  • push(element): element gets pushed on to the top of the stack
  • empty(): returns boolean true if the stack is empty, false if it isn't
  • search(element): returns the position of the element, -1 if element not found

Comment