0 out of 464 challenges solved
Write a Python function `max_occurrences(nums)` that takes a list of integers `nums` and returns the integer that appears most frequently in the list. If there is a tie, return any one of the most frequent integers. If the list is empty, return `None`. #### Example Usage ```python [main.nopy] print(max_occurrences([2, 3, 8, 4, 7, 9, 8, 2, 6, 5, 1, 6, 1, 2, 3, 2, 4, 6, 9, 1, 2])) # Output: 2 print(max_occurrences([10, 20, 20, 30, 40, 90, 80, 50, 30, 20, 50, 10])) # Output: 20 print(max_occurrences([])) # Output: None ```
from collections import defaultdict def max_occurrences(nums): """ Find the item with the maximum frequency in the list. Args: nums (list): A list of integers. Returns: int: The integer with the highest frequency, or None if the list is empty. """ # Initialize a dictionary to count occurrences frequency = defaultdict(int) # Count the occurrences of each number for num in nums: frequency[num] += 1 # Placeholder for the solution pass