Given an Array, three operations can be performed using any external number x.
- Add x to an element once
- Subtract x from an element once
- Perform no operation on the element
- Count of unique elements is 1. Answer is YES with x = 0
- Count of unique elements is 2. Answer is YES with x = Difference of two unique elements.
- Count of unique elements is 3.
- If difference between mid and max is same as difference between mid and min, answer is YES with x = difference between mid and max or mid and min.
- Otherwise answer is NO.
- Check if end of a sorted Array can be reached by repeated jumps of one more, one less or same number of indices as previous jump
- Length of array pair formed where one contains all distinct elements and other all same elements
- External Sorting
- Check whether it is possible to make both arrays equal by modifying a single element
- Maximum possible sum of a window in an array such that elements of same window in other array are unique
- Minimum score possible for a player by selecting one or two consecutive array elements from given binary array
- Find if it is possible to make all elements of an array equal by the given operations
- Make all elements zero by decreasing any two elements by one at a time
- Find smallest possible Number from a given large Number with same count of digits
- Minimum delete operations to make all elements of array same
- Minimum replacements to make elements of a ternary array same
- Minimum Group Flips to Make Binary Array Elements Same
- Minimize steps required to make all array elements same by adding 1, 2 or 5
- Modify given array to make sum of odd and even indexed elements same
- Rearrange array to make Bitwise XOR of similar indexed elements of two arrays is same
- Possible to make a divisible by 3 number using all digits in an array
- Count of all possible pairs of array elements with same parity
- Maximize Sum possible by subtracting same value from all elements of a Subarray of the given Array
- Minimum gcd operations to make all array elements one
- Maximize product of same-indexed elements of same size subsequences
Find whether there exists a number X, such that if the above operations are performed with the number X, the resulting array has equal elements.
If the number exists, print “YES” and the value, space separated, else print “NO”
Input : [1, 1, 3, 5, 5] Output : YES, x = 2 Explanation : The number 2 can be added to the first two elements and can be subtracted from the last two elements to obtain a common element 3 throughout the array Input : [1, 3, 5, 7, 9] Output : NO
The idea is to form groups of unique elements from given array. Following cases arise :
In Python, we can quickly find unique elements using set in Python.
This code has complexity O(n log n)
The same problem could be extended to ask for two numbers required to equalize the array. Following the same process, we would require 5 unique elements in the array to require two numbers to equalize the array. So to require n numbers to equalize an array, we would require (2n + 1) unique elements in the array.
This article is contributed by Deepak Srivatsav. 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.