In this guide, you will get 575. Distribute Candies LeetCode Solution with the best time and space complexity. The solution to Distribute Candies problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
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 1:
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 2:
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 3:
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.
n == candyType.length
2 <= n <= 104
n is even.
-105 <= candyType[i] <= 105
Complexity Analysis
Time Complexity: O(n)
Space Complexity: O(200001)
575. Distribute Candies LeetCode Solution in C++
class Solution {
public:
int distributeCandies(vector<int>& candies) {
bitset<200001> bitset;
for (const int candy : candies)
bitset.set(candy + 100000);
return min(candies.size() / 2, bitset.contains());
}
};
/* code provided by PROGIEZ */
575. Distribute Candies LeetCode Solution in Java
class Solution {
public int distributeCandies(int[] candies) {
BitSet bitset = new BitSet(200001);
for (final int candy : candies)
bitset.set(candy + 100000);
return Math.min(candies.length / 2, bitset.cardinality());
}
}
// code provided by PROGIEZ
575. Distribute Candies LeetCode Solution in Python
class Solution:
def distributeCandies(self, candies: list[int]) -> int:
return min(len(candies) // 2, len(set(candies)))
# code by PROGIEZ
