## Sort a Stack Using Temporary Stack

“Sort a Stack Using Temporary Stack” is again one of the favorite technical interview problems based on stack data structure. Here, in this problem, we are given a stack and our task is to...

Skip to content
# Category: Stacks

##
Sort a Stack Using Temporary Stack

##
Next Greater Frequency Element

##
Print Bracket Number

##
Implement Two Stacks in a Single Array

##
Reverse a String Using Stack

##
Length of Longest Valid Substring

##
Largest Rectangular Area in Histogram

##
Implement Stack Using Linked List

##
Merge Overlapping Intervals

##
Implement Queue Using Stacks

“Sort a Stack Using Temporary Stack” is again one of the favorite technical interview problems based on stack data structure. Here, in this problem, we are given a stack and our task is to...

“Next Greater Frequency Element” is a standard problem of stack data structure. Here, in this problem, we are given an array and our task is to write a program to find the next (right...

“Print Bracket Number” is a stack based basic problem asked in technical round of product- based company. Here, in this problem, we are given a expression string of balanced brackets and our task is...

“Implement Two Stacks in a Single Array” is a popular technical interview problem based on stack. Here, we are given an array of size ‘n’ and our task is to implement two stacks in...

“Reverse a String Using Stack” is a basic problem exercise based on stack data structure. Here, in this problem, we are given a string and our task is to reverse a given string using...

“Length of Longest Valid Substring” is one of the famous technical and algorithmic interview problem based on stack data structure. Here, we are given a string consisting of open and closing parentheses and our...

“Largest Rectangular Area in Histogram” is one of the favorite technical interview problem, asked in many product-based company interview. Problem: We are given a histogram made up of contiguous bars of same width. Our task...

“Implement Stack Using Linked List” is a popular problem based on both linked list and stack data structures. Here, we need to implement stack using linked list. The basic operations that stack data structure...

“Merge Overlapping Intervals” is a standard application of stack data structure. Here, we have given set of intervals and our task is to merge all overlapping intervals and then print the resultant non-overlapping intervals. Example:...

“Implement Queue using Stacks” is a classic interview problem based on stack and queue data structure. Here, we have given two stacks and our task is to implement queue using these two stack. Stack...