## Expression Evaluation Using Stack

Introduction Do you remember the questions in our school exams where we evaluated an infix, postfix or prefix expression? The only thing we could wish for then is a computer program that would directly give us the answer on entering ...

## How to Delete the Middle Element of a Stack?

Introduction Deleting, inserting, searching, and popping are some basic operations done in the stack data structure. There are a whole lot of problems available with these operations. For example, Inserting element at the bottom of a stack.  Problem Statement Given ...

## Sorting a Stack Using a Temporary Stack

Introduction Sorting a stack is one of the frequently asked questions in interviews. Sorting a stack could be tricky and challenging, but don’t worry; today, in this article, we will discuss this problem in-depth and make it a cakewalk for ...

## Understanding Balanced Parentheses

Introduction A string is one of the most popular data structures, probably equal to the array, and you will find at least one String question in any programming job interview. Today we will solve one of the most famous questions ...

## Introduction to Data Structures for Interviews: Stack And Queue

Introduction Before learning about stack and queue, let us first focus on Data Structures Interviews. Data Structure is one of the most important subjects in Computer Science and for all people who dream of cracking a Software Development Engineer (SDE) ...

## How To Sort A Stack Using Recursion?

“To understand a sort in recursion, one must first understand recursion.” In data structures and algorithms, we have always come across the popular use of stack i.e., the LIFO data structure. In the real-world application.” It has proved to be ...

## Reverse a String using Stack

Introduction Reversing a string using a stack and Reserve a string in C++ and C is a common question in all interviews. Most of the technical interviews focus on the string as a major data structure. How can somebody solve ...

## Exploring the STL libraries in C++

The Standard Template Library is a C++ library of container classes, algorithms and iterators; it provides many of the basic algorithms and data structures of computer science. The STL is a generic library, meaning that its components are heavily parameterised: almost every ...

## Difference between Array, Queue & Stack

An array is a random access data structure, where each element can be accessed directly and in constant time. A typical illustration of random access is a book – each page of the book can be open independently of others. Random access ...