Solution 1 - Brute Force
Iterate through every pair of numbers using two nested loops. For each pair, check if they sum to the target. Return the indices when a match is found.
Solution 2 - Brute Force using enumerate()
Same brute force logic, but uses Python's enumerate() for cleaner index tracking instead of range(len(...)).
Solution 1 - Using a Set
Alice has n candies where the i-th candy is of type candyType[i]. She can only eat n / 2 candies. The goal is to maximize the number of different types she can eat. Convert the array to a set to count unique types, then return the minimum of the unique count and n / 2.
Solution 2 - Using Counter
Same logic but uses Counter from the collections module to count unique candy types. The number of keys in the counter gives the unique count.