In this module, we will learn how to solve problems based on stack data structure.


Implement Stack Using Array

Balanced Parentheses

Next Greater Element to the Right

Next Smaller Element to the Right

Next Greater Element to the Left

Next Smaller Element to the Left

Stock Span Problem

Maximum Area of Histogram

Simplify Path

Score of Parenthesis

Find the Most Competitive Subsequence

Smallest Subsequence of Distinct Characters

Design getMin() in Stack in O(1)

If you want to write for us, you can download the image and use it as a background for creating engaging and animated content. We would recommend you to use Canva for creating these images. Please read our writing guidelines.



We're building a next-level EdTech Startup.

Leave A Reply

Your email address will not be published.