## Product of values of all possible non-empty subsets of given Array

Given an array of size N. The task is to find the product of values of all possible non-empty subsets of the given array. Examples:… Read More »

- Number of subsets with zero sum
- Subset with sum closest to zero
- Find whether an array is subset of another array using Map
- Sum of the sums of all possible subsets
- Maximum subset sum such that no two elements in set have same digit in them
- Count of subsets not containing adjacent elements
- Count of all possible pairs of disjoint subsets of integers from 1 to N
- Sum of values of all possible non-empty subsets of the given array
- Probability such that two subset contains same number of elements
- Prime Subset Product Problem
- Sum of squares of all Subsets of given Array
- Divide first N natural numbers into 3 equal sum subsets
- Product of values of all possible non-empty subsets of given Array

Given an array of size N. The task is to find the product of values of all possible non-empty subsets of the given array. Examples:… Read More »

Given an array arr[] of N integers, the task is to find the sum of values of all possible non-empty subsets of array the given… Read More »

Given an array arr[] of N integers. Value of a subset of array A is defined as the product of all prime numbers in that… Read More »

Given an array arr[]. The value of a subset of array A is defined as the sum of squares of all the numbers in that… Read More »

Given an array arr[] of N integers, the task is to find the count of all the subsets which do not contain adjacent elements from… Read More »

Given an integer N, the task is to check whether the elements from the range [1, N] can be divided into three non-empty equal sum… Read More »

Given a set containing N elements. If two subset X and Y picked then find the probability that both of them contains the same number… Read More »

Given an integer N. Consider the set of first N natural numbers A = {1, 2, 3, …, N}. Let M and P be two… Read More »

Given an array a of size N. The task is to find the sum of the sums of all possible subsets. Examples: Input: a[] =… Read More »

Given an array of N elements. Find the subset of elements which has maximum sum such that no two elements in the subset has common… Read More »

Given an array ‘arr’ consisting of integers, the task is to find the non-empty subset such that its sum is closest to zero i.e. absolute… Read More »

Given two arrays: arr1[0..m-1] and arr2[0..n-1]. Find whether arr2[] is a subset of arr1[] or not. Both the arrays are not in sorted order. It… Read More »

Given an array ‘arr’ consisting of integers, the task is to find the number of subsets such that their sum is equal to zero. Empty… Read More »

Given an array arr[], the task is to compute the sum of (max{A} – min{A}) for every non-empty subset A of the array arr[]. Examples:… Read More »

Given an integer array arr[], the task is to check if the input array can be split in two sub-arrays such that: Sum of both… Read More »