chlng1

Author: YuriSpiridonov

Challenges/2021/March-LeetCoding-Challenge.md

@@ -0,0 +1,19 @@
+# March LeetCoding Challenge 2021
+In this repository provided my Python solutions of March LeetCoding Challenge problems.
+
+## Introduction
+In this repository provided my Python solutions of March LeetCoding Challenge problems. 
+- I highly recommend you to try and solve problems yourself before look at the solutions here.
+- Solutions and approaches may be not optimal.
+- All Solutions here are in Python 3.
+
+## Notes
+None
+
+## Week 1
+|№|Title|Solution|Difficulty|
+| ----: | --- | --- | --- |
+|575.|[Distribute Candies](https://leetcode.com/problems/distribute-candies/)|[Python](/Easy/575.DistributeCandies.py)|Easy|
+
+## License
+The code is open-source and licensed under the [MIT License](/LICENSE).

Easy/575.DistributeCandies.py

@@ -0,0 +1,53 @@
+'''
+    Alice has n candies, where the ith candy is of type 
+    candyType[i]. Alice noticed that she started to gain 
+    weight, so she visited a doctor.
+
+    The doctor advised Alice to only eat n / 2 of the candies 
+    she has (n is always even). Alice likes her candies very 
+    much, and she wants to eat the maximum number of 
+    different types of candies while still following the 
+    doctor's advice.
+
+    Given the integer array candyType of length n, return the 
+    maximum number of different types of candies she can eat 
+    if she only eats n / 2 of them.
+
+    Example:
+    Input: candyType = [1,1,2,2,3,3]
+    Output: 3
+    Explanation: Alice can only eat 6 / 2 = 3 candies. Since 
+                 there are only 3 types, she can eat one of 
+                 each type.
+
+    Example:
+    Input: candyType = [1,1,2,3]
+    Output: 2
+    Explanation: Alice can only eat 4 / 2 = 2 candies. Whether 
+                 she eats types [1,2], [1,3], or [2,3], she 
+                 still can only eat 2 different types.
+
+    Example:
+    Input: candyType = [6,6,6,6]
+    Output: 1
+    Explanation: Alice can only eat 4 / 2 = 2 candies. Even 
+                 though she can eat 2 candies, she only has 
+                 1 type.
+
+    Constraints:
+        - n == candyType.length
+        - 2 <= n <= 10^4
+        - n is even.
+        - -10^5 <= candyType[i] <= 10^5
+'''
+#Difficulty: Easy
+#206 / 206 test cases passed.
+#Runtime: 784 ms
+#Memory Usage: 16.3 MB
+
+#Runtime: 784 ms, faster than 82.02% of Python3 online submissions for Distribute Candies.
+#Memory Usage: 16.3 MB, less than 38.32% of Python3 online submissions for Distribute Candies.
+
+class Solution:
+    def distributeCandies(self, candyType: List[int]) -> int:
+        return min(len(candyType)//2, len(set(candyType)))

README.md

@@ -1,6 +1,6 @@
 # Python solutions of LeetCode problems.
 ![Language](https://img.shields.io/badge/language-Python-blue.svg) 
-![Problems Solved](https://img.shields.io/badge/problems%20solved-514%2F1609-orange) 
+![Problems Solved](https://img.shields.io/badge/problems%20solved-515%2F1609-orange) 
 [![License](https://img.shields.io/badge/license-MIT-green.svg)](./LICENSE) 
 ![Update](https://img.shields.io/badge/update-Daily-brightgreen.svg) 
 <br><br>
@@ -21,6 +21,7 @@ In this repository provided my Python solutions of LeetCode problems.
 2021:
 - [January LeetCoding Challenge](/Challenges/2021/January-LeetCoding-Challenge.md) - 27/31
 - [February LeetCoding Challenge](/Challenges/2021/February-LeetCoding-Challenge.md) - 23/28
+- [March LeetCoding Challenge](/Challenges/2021/March-LeetCoding-Challenge.md) - 1/31
 <br><br>
 ## Solutions
 *P.S. If you like this, please leave me a star.* ★
@@ -264,6 +265,7 @@ In this repository provided my Python solutions of LeetCode problems.
 |559.|[Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/)|[Python](/Easy/559.MaximumDepthofN-aryTree.py)|Easy|`BFS`|
 |560.|[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k)|[Python](https://github.com/YuriSpiridonov/30-Day-LeetCoding-Challenge/blob/master/Week%204/SubarraySumEqualsK.py)|Medium|
 |563.|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/)|[Python](/Easy/563.BinaryTreeTilt.py)|Easy|`Binary Tree`, `postorder`, overcode|
+|575.|[Distribute Candies](https://leetcode.com/problems/distribute-candies/)|[Python](/Easy/575.DistributeCandies.py)|Easy||
 |581.|[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/)|[Python](/Medium/581.ShortestUnsortedContinuousSubarray.py)|Medium||
 |589.|[N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/)|[Python](/Easy/589.N-aryTreePreorderTraversal.py)|Easy|`Recursion`|
 |590.|[N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/)|[Python](/Easy/590.N-aryTreePostorderTraversal.py)|Easy|`Recursion`|