Stack Implementation Using Arrays in C
Aditya Bhuyan A stack is a linear data structure that follows the Last In First Out (LIFO) principle. The last element inserted into the stack is the first one to be removed.…
DataStructures
Queue Implementation Using Arrays in C
A queue is a linear data structure that follows the First In First Out (FIFO) principle. The element inserted first is the one that is removed first. A queue typically…
Check if a String of Parentheses is Balanced in C
This program checks whether a string of parentheses (including (), {}, and ) is balanced. A string is considered balanced if every opening parenthesis has a corresponding closing parenthesis in…
Finding the Next Greater Element in C
This program finds the next greater element for each element in a given array. The Next Greater Element (NGE) for an element x is the first greater element to the…
Stack Design with Minimum Element Retrieval in C
This program implements a stack that supports the standard stack operations like push and pop, along with an additional feature to retrieve the minimum element in the stack in constant…
Circular Queue Implementation in C
A circular queue is a linear data structure that operates in a circular fashion. Unlike a normal queue where the rear pointer moves only in one direction, in a circular…
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 evicts the least recently used item…
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 operator follows its operands. For example,…
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 pushing elements and another stack to…
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 a time from left to right,…
