Skip to content

Tag Archives: subset

Given an array, arr[] and an integer X, the task is to count the number of elements greater than X after equally dividing the subset… Read More
Given an array arr[] of length N, the task is to check if it is possible to split the given array into K non-empty and… Read More
Given an array arr[] of N integers, the task is to split the array into two subsets such that the absolute difference between the maximum… Read More
Given an integer array arr[] of consisting of N integers, the task is check if it is possible to divide the given array into K… Read More
Given a distinct integers array arr[] of size N and an integer K, the task is to count the number of subsets of size K… Read More
Given an integer array arr[] and an integer K, the task is to find the number of non-empty subsets S such that min(S) + max(S)… Read More
Given a binary string S, the task is to partition the sequence into K non-empty subsets such that the sum of products of occurences of… Read More
Given a number N, the task is to find the sum of the product of elements of all the possible subsets formed by only divisors… Read More
Given an integer array arr[] of N distinct elements and a positive integer K ( K <= N ). The task is to calculate the… Read More
Given an even number N, the task is to split all N powers of 2 into two sets such that the difference of their sum… Read More
Given an array arr[], the task is to find the maximum sum subset containing the equal number of positive and negative elements.Examples: Input: arr[] =… Read More
Given an array A of size N, our task is to find the length of the largest subset such that all elements in the subset… Read More
Given an integer N, the task is to count the number of subsets formed from an array of integers from 1 to N which doesn’t… Read More
Given an array arr[] of size N consisting of non-negative integers, the task is to find the number of non-empty subsets of the array such… Read More
Given an array arr[] and a number K which is present in the array at least once, the task is to find the number of… Read More