- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks ♣
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Data Structures / Stacks »
A stack is a list displayed vertically, with constrains. Insert, delete, read only from the end. Stacks are like a stack of dishes. In Python the data type for stacks is called list.
What is a stack? What are the constrains when working with stacks? What is the real world example analogy? What's the Python built-in data type for stacks?
Click to Flip Card