EasyPage Replacement Algorithms in Operating SystemsWhat is Page Replacement? The modern operating systems use paging for memory management and many read more
Single NumberGiven an array a[ ] of size n. All the elements in the array are present twice except for 1. Find read more
Shuffle an ArrayGiven an array or set which contains n elements. Here the elements are unique or there is no read more
Special NumberWhat can be so special about a number? Let us find out. We have with us an array of N numbers. A read more
K Empty SlotsK empty slots correctly present a gardener’s dilemma, trying to pick flowers that suit our read more
Bellman Ford AlgorithmBellman Ford Algorithm is used for Finding the shortest path from the source vertex to all the read more
Huffman CodingWe have a message that we want to deliver. We want the message to be of least size possible so that read more
Insert Delete GetRandomIn Insert Delete GetRandom problem we need to design a data structure that supports all following read more
Reservoir SamplingReservoir Sampling is a technique of selecting k reservoir items randomly from a given list of n read more
KMP AlgorithmKMP(Knuth-Morris-Pratt) algorithm is used for pattern searching in a given string. We are given a read more
Evaluate DivisionIn evaluate division problem we have given some equations, in the form, A/B = k, where A and B are read more
Prim’s AlgorithmPrim’s algorithm is used to find the Minimum Spanning Tree(MST) of a connected or undirected read more
Minimum Cost to Hire K WorkersIn minimum cost to hire K workers problem, we have given N workers from which we want to hire read more
Fizz BuzzThe problem name might seem fuzzy. Fizz Buzz is a game with which children are taught about the read more
Flood Fill LeetCodeIn Flood Fill problem we have given a 2D array a[ ][ ] representing an image of size mxn with each read more
Tower Of HanoiTower of Hanoi is a mathematical problem with the following conditions: There are three towers read more
Sliding Window TechniqueBefore getting on and along with what is the sliding window technique? What it does and how it does read more
GCD Of Two NumbersWhat is Greatest Common Factor? GCD of two numbers is the largest number that divides both of them. read more
MiniMax AlgorithmEveryone might be wondering. Argh, another new MINIMAX ALGORITHM. Why do we need it? Let’s read more
Nth Catalan NumberIn the Nth Catalan number problem, we have given an integer n. Find the first n Catalan numbers. read more
Find Median from data StreamIn Find Median from the data Stream problem, we have given that integers are being read from a data read more
Hamming DistanceWhat is Hamming Distance? Hamming distance is Technically defined as the number of bits in the same read more
Number Of 1 bitsWe have all heard of the Hamming Weight of a binary number. Hamming weight is the number of set read more
LRU Cache ImplementationLeast Recently Used (LRU) Cache is a type of method which is used to maintain the data such that read more
Sieve of EratosthenesSieve of Eratosthenes is an algorithm in which we find out the prime numbers less than N. Here N is read more
Alien DictionaryAlien Dictionary is a type of problem in which we have N-words and they are sorted in alien read more
Container with Most WaterProblem description : you are given n integers (y0, y1, y2 … yn-1) at n indices (i = 0,1,2 … read more
Fibonacci numbersFibonacci numbers are the numbers that form the series called Fibonacci series and are represented read more
Heap SortHeap sort is a comparison based sorting technique that is based on a Binary Heap data structure. read more
Dijkstra AlgorithmDijkstra is the shortest path algorithm. Dijkstra algorithm is used to find the shortest distance read more