Skip to content

Topic 12 of 21

Stack & Queue Problems

Implement stacks and queues, convert between infix, prefix and postfix, solve monotonic stack problems and build LRU and LFU caches.

29 stack & queue problems (5 easy, 18 medium, 6 hard) with LeetCode and GeeksforGeeks links.

Your progress

– / 29 solved

Easy
–/5
Medium
–/18
Hard
–/6
  1. Implement Stack Using ArraysEasyGFG
  2. Implement Queue Using ArraysEasyGFG
  3. Implement Stack Using QueueMediumLeetCodeGFG
  4. Implement Queue Using StackMediumLeetCodeGFG
  5. Implement Stack Using LinkedListEasyGFG
  6. Implement Queue Using LinkedListMediumGFG
  7. Check for Balanced ParenthesesMediumLeetCodeGFG
  8. Implement Min StackMediumLeetCodeGFG
  9. Infix to Postfix Conversion Using StackMediumGFG
  10. Prefix to Infix ConversionMediumGFG
  11. Prefix to Postfix ConversionMediumGFG
  12. Postfix to Prefix ConversionMediumGFG
  13. Postfix to InfixMediumGFG
  14. Convert Infix to Prefix NotationMediumGFG
  15. Next Greater ElementEasyLeetCodeGFG
  16. Next Greater Element 2MediumLeetCode
  17. Number of NGEs to the RightEasyGFG
  18. Trapping RainwaterHardLeetCodeGFG
  19. Sum of Subarray MinimumMediumLeetCodeGFG
  20. Asteroid CollisionMediumLeetCodeGFG
  21. Sum of Subarray RangesMediumLeetCodeGFG
  22. Remove K DigitsMediumLeetCodeGFG
  23. Largest Rectangle in a HistogramMediumLeetCodeGFG
  24. Maximal RectanglesHardLeetCodeGFG
  25. Sliding Window MaximumHardLeetCodeGFG
  26. Stock Span ProblemMediumLeetCodeGFG
  27. The Celebrity ProblemHardLeetCodeGFG
  28. LRU CacheHardLeetCodeGFG
  29. LFU CacheHardLeetCodeGFG