## Largest subset having with sum less than equal to sum of respective indices

Given an array arr[], the task is to find the length of the largest subset with the sum of elements less than or equal to… Read More »

- Perfect Sum Problem
- Count of subsets with sum equal to X using Recursion
- Find maximum subset sum formed by partitioning any subset of array into 2 partitions with equal sum
- Number of subsets with same AND, OR and XOR values in an Array
- Sum of cubes of all Subsets of given Array
- Sum of all subset sums of a linked list
- Find the length of the Largest subset such that all elements are Pairwise Coprime
- Total number of Subsets of size at most K
- Partition of a set into K subsets with equal sum using BitMask and DP
- Count of Subsets containing only the given value K
- Product of all sorted subsets of size K using elements whose index divide K completely
- Count of subsets of integers from 1 to N having no adjacent elements
- Count of subsets having sum of min and max element less than K
- Partition a set into two subsets such that difference between max of one and min of other is minimized
- Sum of product of all subsets formed by only divisors of N
- Split N powers of 2 into two subsets such that their difference of sum is minimum
- Split a binary string into K subsets minimizing sum of products of occurrences of 0 and 1
- Divide array in two Subsets such that sum of square of sum of both subsets is maximum
- Subsets of size K with product equal to difference of two perfect squares
- Maximum sum subset having equal number of positive and negative elements
- Count of Subsets of a given Set with element X present in it
- Product of all Subsets of a set formed by first N natural numbers
- Largest subset with M as smallest missing number
- Largest subset having with sum less than equal to sum of respective indices
- Maximum size subset with given sum using Backtracking
- Split array into K subsets to maximize their sum of maximums and minimums

Given an array arr[], the task is to find the length of the largest subset with the sum of elements less than or equal to… Read More »

Given an array arr[] of N positive integers and a positive integer M, the task is to find the length of longest subset whose smallest… Read More »

Given an integer K and an array A[ ] whose length is multiple of K, the task is to split the elements of the given… Read More »

Given an array arr[] consisting of N integers and an integer K, the task is to find the length of longest subsequence with sum equal… Read More »

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 »