Get started
Start with DSA Fundamentals
Programming Fundamentals
Back to modulesModule 09 · 0/34
Module 09
Stacks and Queues
0/346226
Learning0/12
- 1Implement Stack using ArrayEasy
- 1Introduction to Priority Queues using Binary HeapsMed.
- 2Implement Queue using ArrayEasy
- 2Implement Min Heap and Max HeapMed.
- 3Implement Stack using Linked ListEasy
- 3Check if Array Represents a Min-HeapMed.
- 4Implement Queue using Linked ListMed.
- 4Convert Min Heap to Max HeapMed.
- 5Check for Balanced ParenthesesMed.
- 6Implement Stack using QueueMed.
- 7Implement Queue using StackMed.
- 8Implement Min StackMed.
Prefix, Infix, Postfix Conversion Problems0/6
Monotonic Stack & Queue Problems0/13
- 1Next Greater ElementEasy
- 2Next Greater Element IIMed.
- 3Next Smaller ElementEasy
- 4Number of NGEs to the RightEasy
- 5Stock Span ProblemMed.
- 6Asteroid CollisionMed.
- 7Sum of Subarray MinimumsMed.
- 8Sum of Subarray RangesMed.
- 9Remove k DigitsMed.
- 10Trapping RainwaterHard
- 11Largest Rectangle in HistogramMed.
- 12Maximal RectanglesHard
- 13Sliding Window MaximumHard