Functional Programming
  • Preface
  • Getting Started
  • Sorting
    • Bubble Sort
    • Merge Sort
    • Insertion Sort
  • Stacks
    • Stack
  • Queues
    • Queue
    • Binary Heap (Priority Queue)
  • Trees
    • Binary Tree (Unbalanced)
    • Prefix Trie
  • Graphs
    • Undirected
    • Directed
    • Edge Weighted
  • Dynamic Programming
    • Knapsack
    • Longest Common Substring
    • Staircase
  • Leetcode/InterviewBit
    • 2 Sum [Easy]
    • Longest Valid Parentheses [Medium-Hard]
    • Kth Smallest Element [Medium]
    • Max Profit [2 variations: 1st Easy 2nd Hard]
    • Pretty Print 2D Matrix [Easy]
    • Max Contiguous Subarray (Kadane's) [Medium (just cause its tricky)]
    • Permutations [Medium]
    • Next Permutation [Medium]
Powered by GitBook
On this page
  • Algorithm
  • Implementation

Was this helpful?

  1. Stacks

Stack

PreviousStacksNextQueues

Last updated 6 years ago

Was this helpful?

This one's as straightforward as it gets. List i.e. an immutable linked list is precisely a stack

Algorithm

Operation

Complexity

Push

Pop

Implementation

object Stack {

  def push[A](as: List[A], a: A): List[A] =
    a :: as

  def pop[A](as: List[A]): (Option[A], List[A]) =
    as.headOption -> as.tail

}
O(1)O(1)O(1)
O(1)O(1)O(1)