Sum of Unique Elements
easySave
ArrayCountingHash Table
Given an array of integers, calculate the sum of all the unique integers in the array. An integer is considered unique if it appears exactly once in the array.
Example 1
Input
[ [ 4, 4, 5, 6, 7, 7 ] ]
Output
11
Explanation. 5 and 6 are unique integers in the array. Their sum is 11.
Example 2
Input
[ [ 1, 2, 3, 2 ] ]
Output
4
Explanation. 1 and 3 are unique integers in the array. Their sum is 4.
Example 3
Input
[ [ -1, -1, -2, 3, 4 ] ]
Output
5
Explanation. -2, 3, and 4 are unique integers in the array. Their sum is 5.
Example 4
Input
[ [ 100, 200, 100, 300 ] ]
Output
500
Explanation. 200 and 300 are unique integers in the array. Their sum is 500.
Example 5
Input
[ [ 7 ] ]
Output
7
Explanation. 7 is the only integer in the array and is unique by default. The sum is 7.
Follow-up: Can you solve the problem in linear time complexity?
Constraints:
1. The array will contain at least one element.\n2. All elements are integers from -1000 to 1000.
- Views
- 3