Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learning Data Structures
·
Module 6
Stacks & Queues
1
Stacks and Queues: Array and Linked List Implementations
Implement a stack and a queue using arrays or linked lists to understand their LIFO/FIFO principles.
2
Mastering Java's Stack, Queue, and Deque
Use Java's `Stack`, `Queue`, and `Deque` collections to solve problems.
3
Valid Parentheses: A Stack-Based Solution
Solve the 'Valid Parentheses' problem using a stack.
4
Monotonic Stack: Next Greater Element
Apply the monotonic stack pattern to find the 'Next Greater Element' for all elements in an array.
5
Largest Rectangle in Histogram: Monotonic Stack Approach
Calculate the largest rectangle in a histogram using a monotonic stack.
6
Trapping Rainwater: From Brute-Force to Two-Pointers
Solve the 'Trapping Rainwater' problem, progressing from a brute-force approach to an optimal two-pointer solution.
7
Sliding Window Maximum with Deque
Solve the 'Sliding Window Maximum' problem efficiently using a Deque.
Next module isn't ready yet,
Back to course
Previous module
Linked Lists
Next module