* * * * Prepare | Algorithms | Implementation | Equalize the Array
* Question Link: https://www.hackerrank.com/challenges/equality-in-a-array/problem?isFullScreen=true&utm_campaign=challenge-recommendation&utm_medium=email&utm_source=7-day-campaign
* What You SHOULD KNOW:
1. std::vector
2. std::map
3. std::max_element()
* Github Link: https://github.com/subrat80/hacker-rank-algo/blob/main/29-equalizeArray.cpp
**- Ex: {1,2,1,4,3,2,1,7}. 1 & 2 are repeating
* Check the max occurrence of a number.
* Ex: Here 1 repeating 3 times & 2 is repeating 2 times. So we need to consider 1 as the final
* number to stay inside array as we need to do deletion less no of times.
* - return (array size - max_no_of_repetation_of_a_number
Need any help from me in C++: https://subratswain.com
mail me: [email protected]
Happy Learning!!!
