Sum of Unique Elements
Add up only the values of nums that appear exactly once in the list. Return 0 if there are none.
Example 1
nums [1,2,3,2]
returns 4
1 and 3 appear once: 4.
Example 2
nums [1,1,1,1]
returns 0
Nothing is unique.
Constraints
1 <= len(nums) <= 50-20 <= nums[i] <= 20
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Hash maps problems
- Top K Frequent ElementsEasy
- Unique Morse Code WordsEasy
- Unique OccurrencesEasy
- Widest Spread ValueEasy
- Bulls and CowsMedium
- Contiguous ArrayMedium
- Group AnagramsMedium
- Longest Consecutive SequenceMedium