Tag Archives: subset

Given an array arr[] of size N and an integer K, the task is to print all possible ways to split the given array into… Read More
Given an array arr[] of size N, the task is to split the array into two subsets such that the Bitwise XOR between the maximum… Read More
Given an array arr[] of size N and an integer K, the task is to minimize the sum of difference between the maximum and minimum… Read More
Given an array arr[] consisting of N distinct integers, the task is to find the minimum number of times the array needs to be split… Read More
Given a numeric string str of length N, the task is to find the sum of all possible expressions by inserting the ‘+’ operator between… Read More
Given an array arr[] of size N and an integer K (N % K = 0), the task is to split array into subarrays of… Read More
Given an array arr[] of size N, the task is to find the count of all subsets from the given array whose product of is… Read More
Given two arrays A[] and B[] of size N and an integer K, the task is to check if all possible subset-sums of subsets of… Read More
Given an array arr[] consisting of N positive integers, the task is to minimize the remaining array element that can be obtained by repeatedly removing… Read More
Given an array arr[] of size N, two positive integers M and K, the task is to partition the array into M equal length subsets… Read More
Given a 2D array arr[][] of size N * M, and an integer K, the task is to select K elements with maximum possible sum… Read More
Given an array arr[] consisting of N integers and an integer K, the task is to split the array into K subsets (N % K… Read More
Given an array, arr[] of size N, the task is to find the median of sums of all possible subsets of the given array. Examples:… Read More
Given an array arr[] consisting of N positive integers and the integers X and M, where 0 <= X < M, the task is to… Read More
Given an array arr[] of size N and an integer K, the task is to count the number of subsets from the given array with… Read More