Skip to content

Practice Distribute Candies

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#575
LeetCode Problem

Distribute Candies

ArrayHash Table

Problem Statement

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.

Source: Distribute Candies on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
candyType = [1,1,2,2,3,3]
Output
3

# Example 2

Input
candyType = [1,1,2,3]
Output
2

# Example 3

Input
candyType = [6,6,6,6]
Output
1

Constraints

n == candyType.length
2 <= n <= 10^4
n is even.
-10^5 <= candyType[i] <= 10^5

Related LeetCode Problems

Practice more problems similar to Distribute Candies.

1 Two Sum Easy36 Valid Sudoku Medium37 Sudoku Solver Hard3 Longest Substring Without Repeating Characters Medium4 Median of Two Sorted Arrays Hard
← Previous Subtree of Another TreeNext → Out of Boundary Paths

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free