Daily challenge for 2026-02-13
409. Distinct Element Frequency Counter
Given an array of integers nums, return the frequency of the least common non-zero element. If all elements are zero or the array is empty, return 0. Use a hash map to count frequencies.
Example:Input: [1,2,2,3,3,3]Output: 1
Run this challenge interactively in Python or JavaScript when the app loads.