solves distribute candies

Author: anishLearnsToCode

Diff for: README.md

@@ -151,7 +151,7 @@
 | 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | Easy | [![Java](assets/java.png)](src/BinaryTreeTilt.java) [![Python](assets/python.png)](python/binary_tree_tilt.py) |
 | 566 | [Reshape The Matrix](https://leetcode.com/problems/reshape-the-matrix) | Easy | [![Java](assets/java.png)](src/ReshapeTheMatrix.java) [![Python](assets/python.png)](python/reshape_the_matrix.py) |
 | 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | Easy | [![Java](assets/java.png)](src/SubtreeOfAnotherTree.java) [![Python](assets/python.png)](python/subtree_of_another_tree.py) |
-| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | Easy | |
+| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | Easy | [![Java](assets/java.png)](src/DistributeCandies.java) [![Python](assets/python.png)](python/distribute_candies.py) |
 | 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | Easy | |
 | 589 | [N-Ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | Easy | |
 | 590 | [N-Ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | Easy | |

Diff for: python/distribute_candies.py

@@ -0,0 +1,6 @@
+from typing import List
+
+
+class Solution:
+    def distributeCandies(self, candyType: List[int]) -> int:
+        return min(len(candyType) // 2, len(set(candyType)))

Diff for: src/DistributeCandies.java

@@ -0,0 +1,13 @@
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.Set;
+
+public class DistributeCandies {
+    public int distributeCandies(int[] candyType) {
+        Set<Integer> candyTypes = new HashSet<>();
+        for (int type : candyType) {
+            candyTypes.add(type);
+        }
+        return Math.min(candyType.length / 2, candyTypes.size());
+    }
+}