Refactored Distribute Candies.java

Author: varunu28

Easy/Distribute Candies.java

@@ -1,15 +1,8 @@
 class Solution {
-    public int distributeCandies(int[] candies) {
-        Map<Integer, Integer> count = new HashMap<>();
-        int unique = 0;
-        int n = candies.length;
-        for (int i=0;i<n;i++) {
-            if (!count.containsKey(candies[i])) {
-                unique++;
-            }
-            count.put(candies[i],1);
-        }
-
-        return unique > n/2 ? n/2 : unique;
-    }
+  public int distributeCandies(int[] candyType) {
+    return Math.min(
+      Arrays.stream(candyType).boxed().collect(Collectors.toSet()).size(),
+      candyType.length / 2
+    );
+  }
 }