A circular queue is a linear data structure that operates in a circular fashion. Unlike a normal queue where the rear pointer moves only […]
Author: Aditya Bhuyan
C
Least Recently Used (LRU) Cache Implementation in C
An LRU (Least Recently Used) cache is a data structure that stores a fixed number of elements. When the cache reaches its limit, it […]
C
Evaluate Postfix Expression Using a Stack in C
This program evaluates a postfix expression using a stack. A postfix expression (also known as Reverse Polish Notation) is a mathematical expression where the […]
C
Sorting Stack Using Another Stack in C
This program demonstrates how to sort the elements in a stack using another temporary stack. The idea is to use the main stack for […]
C
Sliding Window Maximum in C
This program finds the maximum element in each sliding window of size k for a given array. The sliding window moves one element at […]
C++
Implementing a Stack using an Array in C++
This C++ program demonstrates how to implement a stack using an array. A stack is a LIFO (Last In First Out) data structure used […]
C++
Implementing a Queue using an Array in C++
This C++ program demonstrates how to implement a queue using an array. A queue is a FIFO (First In First Out) data structure used […]
C++
Check Balanced Parentheses in C++
This C++ program checks if a string consisting of parentheses is balanced. A string of parentheses is considered balanced if every type of bracket […]
C++
Find Next Greater Element in an Array – C++
This C++ program finds the next greater element for each element in an array. The next greater element for an element x is the […]
C++
Min Stack Implementation – C++
This C++ program implements a stack that supports standard stack operations (push and pop), along with retrieving the minimum element in constant time. This […]
