Distribute candies

Array Hash Table

70.8% acceptance

Jan 13, 2026

1728

1474

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.

Solution

Rust

Time O(n)

Space O(1)

LeetCode

solution.rs

impl Solution {
  pub fn distribute_candies(candy_type: Vec<i32>) -> i32 {
    use std::collections::HashSet;
    let types = candy_type.iter().collect::<HashSet<_>>().len() as i32;
    types.min(candy_type.len() as i32 / 2)
  }
}