Package g1301_1400.s1338_reduce_array_size_to_the_half

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1338 - Reduce Array Size to The Half.

    Medium

    You are given an integer array arr. You can choose a set of integers and remove all the occurrences of these integers in the array.

    Return the minimum size of the set so that at least half of the integers of the array are removed.

    Example 1:

    Input: arr = 3,3,3,3,5,5,5,2,2,7

    Output: 2

    Explanation: Choosing {3,7} will make the new array 5,5,5,2,2 which has size 5 (i.e equal to half of the size of the old array).

    Possible sets of size 2 are {3,5},{3,2},{5,2}.

    Choosing set {2,7} is not possible as it will make the new array 3,3,3,3,5,5,5 which has a size greater than half of the size of the old array.

    Example 2:

    Input: arr = 7,7,7,7,7,7

    Output: 1

    Explanation: The only possible set you can choose is {7}. This will make the new array empty.

    Constraints:

    • <code>2 <= arr.length <= 10<sup>5</sup></code>

    • arr.length is even.

    • <code>1 <= arri<= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minSetSize(IntArray arr)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait