## Maximum difference between two subsets of m elements

Given an array of n integers and a number m, find the maximum possible difference between two sets of m elements chosen from given array.… Read More »

Given an array of n integers and a number m, find the maximum possible difference between two sets of m elements chosen from given array.… Read More »

In previous post i.e. Set 1 we have discussed that implements these below functions: insert(H, k): Inserts a key ‘k’ to Binomial Heap ‘H’. This… Read More »

Given two equally sized arrays (A, B) and N (size of both arrays). A sum combination is made by adding one element from array A… Read More »

Given an n x n matrix and integer k. Find the k’th smallest element in the given 2D array. Examples: Input : mat = [[10,… Read More »

We have discussed one loss minimization strategy before: Job Sequencing Problem – Loss Minimization. In this article, we will look at another strategy that applies… Read More »

Given n, how many distinct Max Heap can be made from n distinct integers? Examples: Input : n = 3 Output : Assume the integers… Read More »

Given an array arr[] containing n elements. The problem is to find maximum number of distinct elements after removing k elements from the array. Note:… Read More »

Given an n x n matrix, where every row and column is sorted in non-decreasing order. Print all elements of matrix in sorted order. Examples:… Read More »

Given the sequence find the lexicographically smallest (earliest in dictionary order) derangement of . A derangement of S is as any permutation of S such… Read More »

Given two sorted arrays, the task is to merge them in a sorted manner. Examples: Input : arr1 = [1, 3, 4, 5] arr2 =… Read More »

Given any sequence , find the largest derangement of . A derangement is any permutation of , such that no two elements at the same… Read More »

Binary Heap is a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left… Read More »

Given an array of n positive integers. We are required to write a program to print the minimum product of k integers of the given… Read More »

Given an array of integers. Write a program to find the K-th largest sum of contiguous subarray within the array of numbers which has negative… Read More »

Given a binary min heap and a value x, print all the binary heap nodes having value less than the given value x. Examples :… Read More »