Embark on a comprehensive learning journey into the world of Stacks and Queues. This path covers fundamental concepts, various implementation techniques, and tackles a wide array of classic and complex algorithmic problems. You will learn to apply these powerful data structures to solve problems ranging from expression conversions and finding next greater elements to optimizing cache mechanisms (LRU, LFU) and calculating areas in histograms.
L5. Next Greater Element | Stack and Queue Playlist
18:25
L6. Next Greater Element - II | Stack and Queue Playlist
15:41
L7. Previous Smaller Element | Stack and Queue Playlist
8:11
L8. Trapping Rainwater | 2 Approaches | Stack and Queue Playlist
28:58
L9. Sum of Subarray Minimum | Stack and Queue Playlist
23:35
L10. Sum of subarray ranges | Stack and Queue Playlist
10:34
L11. Aestroid Collisions | Stack and Queue Playlist
17:28
L12. Largest Rectangle in Histogram | Stack and Queue Playlist
31:42
L13. Maximal Rectangle | Stack and Queue Playlist
12:12
L14. Remove K Digits | Stack and Queue Playlist
15:29
L15. Stock Span Problem | Stack and Queue Playlist
19:21
L16. Sliding Window Maximum | Stack and Queue Playlist
19:58
Quiz: Module 2: Monotonic Stack & Queue Applications
10 min