Overview
Mario and Luigi, Romeo and Juliet, Sherlock and Watson… Stacks and Queues are another iconic duo. Stacks and queues are data structures used to store and manage collections of elements, with stacks following a Last In, First Out (LIFO) order and queues following a First In, First Out (FIFO) order.
Prerequisites
- Big O Notation
Learning Objectives
By the end of this module, learners will be able to:
- Distinguish between a stack and a queue.
- Determine situations in which you’d use a stack or queue over another data structure.
- Build a stack and a queue using a linked list or an array.
Content
There are two components to this module:
- Lesson: Stacks and Queues
- Exercise: Bracket Matching
Solution Code
- Exercise Solution: Bracket Matching
Time to Complete
1.5 hours total:
- 0.5 hour - Stacks and Queues Lesson
- 1 hour - Bracket Matching Exercise
Additional Resources
- Here are visualizations for the two implementations of stacks: the array implementation and linked list implementation.
- Same thing for queues: the array implementation and linked list implementation.
- Common interview questions about stacks and queues.
- Don’t forget to review priority queues and deques.
Internal resources
Find a 👾 bug 👾 or have suggestions? Let us know!