Least Recently Used (LRU) Cache Implementation – C++
Aditya Bhuyan This C++ program implements a Least Recently Used (LRU) cache. The LRU cache mechanism is used to maintain a set of items such that the least recently used items are…
September 2024
Evaluate Postfix Expression Using a Stack – C++ Implementation
This C++ program demonstrates how to evaluate a postfix expression using a stack. Postfix, or reverse Polish notation (RPN), is a mathematical notation wherein every operator follows all of its…
Sort Stack Using Another Stack – C++ Implementation
This C++ program demonstrates how to sort a stack using only another temporary stack. The program sorts the original stack in ascending order where the smallest elements end up on…
Sliding Window Maximum – C++ Implementation
Sliding Window Maximum – C++ Implementation This C++ program finds the maximum value in each sliding window of size k in a given array using an efficient method. #include #include…
Implementing a Stack Using an Array in Go
This program demonstrates the implementation of a stack using an array (slice) in Go. The stack supports push, pop, peek, and empty operations, functioning as a LIFO (Last In First…
Implementing a Queue Using an Array in Go
This program demonstrates the implementation of a queue using an array in Go. The queue supports enqueue, dequeue, peek, and empty operations, functioning as a FIFO (First In First Out)…
Check If Parentheses are Balanced in Go
This program checks if a string of parentheses is balanced. A balanced string means every opening parenthesis (‘(‘) has a corresponding closing parenthesis (‘)’) and they are correctly nested. Program…
Next Greater Element Finder in Go
This program finds the next greater element for each element of a given array. The next greater element for an element x is the first greater element on the right…
Special Stack with Min Functionality in Go
This program demonstrates a special stack that supports standard push and pop operations and can also return the minimum element in constant time. The stack utilizes an auxiliary stack that…
Implementing a Circular Queue in Go
This program demonstrates the implementation of a circular queue using the Go programming language. Circular queues are particularly useful in scenarios where continuous or cyclic usage of the queue is…
