## Largest divisible pairs subset

Given an array of n distinct elements, find length of the largest subset such that every pair in the subset is such that the larger… Read More »

Given an array of n distinct elements, find length of the largest subset such that every pair in the subset is such that the larger… Read More »

Given an array and two integers k and d, find the number of subsets of this array of size k, where difference between the maximum… Read More »

Given a number n, we need to find the sum of all the elements from all possible subsets of a set formed by first n… Read More »

Given a set of n numbers. The task is to count all the subsets of the given set which only have even numbers and all… Read More »

Given an array with positive number the task is that we find largest subset from array that contain elements which are Fibonacci numbers. Asked in… Read More »

Given a set of non-negative distinct integers, and a value m, determine if there is a subset of the given set with sum divisible by… Read More »

Given an array of integers and a sum, the task is to print all subsets of given array with sum equal to given sum. Examples:… Read More »

Given an array of integer values, we need to find the minimum difference between maximum and minimum of all possible K-length subsets. Examples: Input :… Read More »

Given an array the task is to largest divisible subset in array. A subset is called divisible if for every pair (x, y) in subset,… Read More »

Given a set of integers, find distinct sum that can be generated from the subsets of the given sets and print them in an increasing… Read More »

Given an array arr[] and a number of queries, where in each query we have to check whether a subset whose sum is equal to… Read More »

Given an array of n integers where each value represents number of chocolates in a packet. Each packet can have variable number of chocolates. There… Read More »

Given an array of distinct positive numbers, the task is to calculate the number of subsets (or subsequences) from the array such that each subset… Read More »

Given an array arr[] of n numbers and a number K, find the number of subsets of arr[] having XOR of elements as K Examples:… Read More »

Given a set of n elements, find number of ways of partitioning it. Examples: Input: n = 2 Output: Number of ways = 2 Explanation:… Read More »