Leetcode Problem 1338. Reduce Array Size to The Half

1338. Reduce Array Size to The Half

Leetcode Solutions

Approach: Sorting and Greedy Selection

  1. Sort the input array arr.
  2. Initialize a variable count to store the occurrences of each number.
  3. Iterate through the sorted array, incrementing count for each number.
  4. Sort the count array in descending order.
  5. Initialize variables removed to track the number of elements removed and setSize to track the size of the set.
  6. Iterate through the count array, adding the count to removed and incrementing setSize until removed is at least half the size of the original array.
  7. Return setSize as the result.
UML Thumbnail

Approach: Hashing/Counting and Sorting

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...