Given an array where every element occurs a times, except one element which occurs b (a>b) times. Find the element that occurs b times.
Input : arr = [1, 1, 2, 2, 2, 3, 3, 3] a = 3, b = 2 Output : 1
Add each number once and multiply the sum by a, we will get a times the sum of each element of the array. Store it as a_sum. Subtract the sum of the whole array from the a_sum and divide the result by (a-b). The number we get is the required number (which appears b times in the array).
Please refer below article for more approaches.
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Reduce the array such that each element appears at most 2 times
- Reduce the array such that each element appears at most K times
- First element that appears even number of times in an array
- Find the element that appears once in an array where every other element appears twice
- Find the element that appears once
- Find the element that appears once in a sorted array
- Remove characters from a String that appears exactly K times
- Check if max occurring character of one string appears same no. of times in other
- Count all elements in the array which appears at least K times after their first occurrence
- Remove characters from string that appears strictly less than K times
- Maximum number of times str1 appears as a non-overlapping substring in str2
- Find the K-th minimum element from an array concatenated M times
- Maximum difference between two elements such that larger element appears after the smaller number
- First element occurring k times in an array
- Check whether K times of a element is present in array
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.