Hard Problems on Subset
- Minimize count of divisions by D to obtain at least K equal array elements
- Split array into K-length subsets to minimize sum of second smallest element of each subset
- Median of all non-empty subset sums
- Minimum removals required such that sum of remaining array modulo M is X
- Sum of length of two smallest subsets possible from a given array with sum at least K
- Reduce sum of any subset of an array to 1 by multiplying all its elements by any value
- Sum of all subsets whose sum is a Perfect Number from a given array
- Minimize sum of incompatibilities of K equal-length subsets made up of unique elements
- Maximize sum of subsets from two arrays having no consecutive values
- Product of the maximums of all subsets of an array
- Count ways to place ‘+’ and ‘-‘ in front of array elements to obtain sum K
- Count ways to split array into two subsets having difference between their sum equal to K
- Find the subset of Array with given LCM
- Count of subsets whose product is multiple of unique primes
- Minimum count of elements to be inserted in Array to form all values in [1, K] using subset sum
- Maximum subset sum having difference between its maximum and minimum in range [L, R]
- Find all unique subsets of a given set using C++ STL
- Subset sum problem where Array sum is at most N
Related Articles:
Data Structure and Algorithms Course
Recent articles on Subarray
Recent articles on Subsequence
Recent articles on Subset