@@ -0,0 +1,441 @@
+from collections import Counter%0A%0Aclass Solution:%0A    def minSetSize(self, arr: List%5Bint%5D) -%3E int:%0A        if len(arr) == 0:%0A            return 0%0A        c = Counter(arr)%0A        min_set_size = 0%0A        min_set_count = 0%0A        for _, count in c.most_common():%0A            min_set_size += 1%0A            min_set_count += count%0A            if min_set_count %3E= len(arr)/2:%0A                return min_set_size%0A        # shouldn't reach here :)%0A

1338. Reduce Array Size to The Half