## Minimum product subset of an array

Given an array a, we have to find minimum product possible with the subset of elements present in the array. The minimum product can be… Read More »

Given an array a, we have to find minimum product possible with the subset of elements present in the array. The minimum product can be… Read More »

Given an array a, we have to find maximum product possible with the subset of elements present in the array. The maximum product can be… Read More »

There are n cores of processor. Each core can process a task at a time. Different cores can process different tasks simultaneously without affecting others.… Read More »

Given a number n, the task is to find the largest perfect cube that can be formed by deleting minimum digits(possibly 0) from the number.… Read More »

Given an array, we need to find the maximum sum of absolute difference of the array elements for a sequence of this array. Examples: Input… Read More »

Given N(very large), task if to print the largest palindromic number obtained by permuting the digits of N. If it is not possible to make… Read More »

Given an array arr[], find the lexicographically largest array that can be obtained by performing at-most k consecutive swaps. Examples : Input : arr[] =… Read More »

There are n servers. Each server i is currently processing a(i) amount of requests. There is another array b in which b(i) represents number of… Read More »

Given a number k, find the required minimum number of Fibonacci terms whose sum equal to k. We can choose a Fibonacci number multiple times.… Read More »

You are given an array of n-elements, you have to find the number of operations needed to make all elements of array equal. Where a… Read More »

You are a poor person in an island. There is only one shop in this island, this shop is open on all days of the… Read More »

Given n arrays of size m eacg. Find maximum sum obtained by selecting a number from each array such that the elements selected from i-th… Read More »

There are n cities and there are roads in between some of the cities. Somehow all the roads are damaged simultaneously. We have to repair… Read More »

Huffman Encoding is an important topic from GATE point of view and different types of questions are asked from this topic. Before understanding this article,… Read More »

Minimum spanning Tree (MST) is an important topic for GATE. Therefore, we will discuss how to solve different types of questions based on MST. Before… Read More »