Skip to content

Tag Archives: subset

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 the number of chocolates in a packet. Each packet can have a variable number of… 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 integer elements, the task is to find sum of average of all subsets of this array. Example : Input… 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 KExamples : … 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
  Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to… Read More
Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is… Read More
Subset sum problem is to find subset of elements that are selected from a given set whose sum adds up to a given number K. We… Read More