Given an array of integer numbers, we need to find maximum size of a subset such that sum of each pair of this subset is not divisible by K.
Input : arr = [3, 7, 2, 9, 1] K = 3 Output : 3 Maximum size subset whose each pair sum is not divisible by K is [3, 7, 1] because, 3+7 = 10, 3+1 = 4, 7+1 = 8 all are not divisible by 3. It is not possible to get a subset of size bigger than 3 with the above-mentioned property. Input : arr = [3, 17, 12, 9, 11, 15] K = 5 Output : 4
We can solve this problem by computing modulo of array numbers with K. if sum of two numbers is divisible by K, then if one of them gives remainder i, other will give remainder (K – i). First we store frequencies of numbers giving specific remainder in a frequency array of size K. Then we loop for all remainders i and include max(f[i], f[K – i]). Why? a subset with no pair sum divisible by K must include either elements with remainder f[i] or with remainder f[K – i]. Since we want to maximize the size of subset, we pick maximum of two sizes.
In below code array numbers with remainder 0 and remainder K/2 are handled separately. If we include more than 2 numbers with remainder 0 then their sum will be divisible by K, so we have taken at max 1 number in our consideration, same is the case with array numbers giving remainder K/2.
Time Complexity: O(N + K)
Auxiliary Space: O(K)
This article is contributed by Utkarsh Trivedi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Sum of maximum and minimum of Kth subset ordered by increasing subset sum
- Largest subset with sum of every pair as prime
- Subset with sum divisible by m
- Pair formation such that maximum pair sum is minimized
- Number of indices pair such that element pair sum from first Array is greater than second Array
- Largest divisible subset in array
- Size of the largest divisible subset in an Array
- Largest divisible pairs subset
- Minimum pair sum operations to make array each element divisible by 4
- Subarray with no pair sum divisible by K
- Check if any permutation of array contains sum of every adjacent pair not divisible by 3
- Largest subset having with sum less than equal to sum of respective indices
- Maximum Subset Sum possible by negating the entire sum after selecting the first Array element
- Pair with given product | Set 1 (Find if any pair exists)
- Probability of a random pair being the maximum weighted pair
- Store duplicate keys-values pair and sort the key-value pair by key
- Triplet pair (a, b, c) such that a+b, b+c and a+c are all divisible by K
- Check if there is any pair in a given range with GCD is divisible by k
- Count of subarrays of size K having at least one pair with absolute difference divisible by K-1
- Split an array into groups of 3 such that X3 is divisible by X2 and X2 is divisible by X1