Stack and Queue - DSA

By take U forward

Master essential stack and queue data structures through rigorous algorithmic problem-solving and optimization techniques. Elevate your technical interview readiness by conquering complex coding patterns across multiple paradigms.

Table of Contents

Stack and Queue - DSA

Table of Contents

L1. Introduction to Stack and Queue | Implementation using Data Structures

L2. Check for Balanced Parentheses | Stack and Queue

L3. Prefix, Infix, and Postfix Conversion | Stack and Queue Playlist

L4. Implement Min Stack | Stack and Queue Playlist

L5. Next Greater Element | Stack and Queue Playlist

L6. Next Greater Element - II | Stack and Queue Playlist

L7. Previous Smaller Element | Stack and Queue Playlist

L8. Trapping Rainwater | 2 Approaches | Stack and Queue Playlist

L9. Sum of Subarray Minimum | Stack and Queue Playlist

L10. Sum of subarray ranges | Stack and Queue Playlist

L11. Aestroid Collisions | Stack and Queue Playlist

L12. Largest Rectangle in Histogram | Stack and Queue Playlist

L13. Maximal Rectangle | Stack and Queue Playlist

L14. Remove K Digits | Stack and Queue Playlist

L15. Stock Span Problem | Stack and Queue Playlist

L16. Sliding Window Maximum | Stack and Queue Playlist

L17. The Celebrity Problem | Stack and Queue Playlist

L18. Implement LRU Cache

Implement LFU cache in C++/Java | Leetcode(Hard)