- Published on

# Sum of Unique Elements.

Helllllooooo!

Pretty much excited about today's problem (No, 17 is not my lucky number.) Cool, let's directly jump to the challenge for Day #17 of my coding diary.

**Problem of the day** - Sum of Unique Elements

**Tag** - Easy

You are given an integer array `nums`

. The unique elements of an array are the elements that appear **exactly once** in the array.

Return *the sum of all the unique elements of*

`nums`

.**Example 1:**

**Input:** nums = [1,2,3,2]
**Output:** 4
**Explanation:** The unique elements are [1,3], and the sum is 4.

The problem is quite easy to understand. Now, after solving some good number of problems, I feel, multiple approaches are striking to my mind instantly, after reading the problem statement (or may be the problems are easy!)

So, we need to find the sum of only unique elements in the array. Ummm, as of now I can think of three approaches.

### 1. My all-time savior best friend, Hashmap

- Loop over the list, save the count of each element in the hashmap
- Loop over the list again, if the count is 1, add else tata-bye-bye
- just return the final result

**Here is the code** -

`class Solution {public: int sumOfUnique(vector<int>& nums) { int res = 0; map<int,int> hash; for(int num: nums) { hash[num]++; } for(int num: nums) { if(hash[num] == 1) res += num; } return res; }};`

Pretty nice solution.

### 2. Using sort

- Sort the list
- Loop over the list and just check if the previous element is the same (means element is duplicated), skip that

Ahh, please don't be angry with me for not coding the solution for this. It would be a too slow approach, `O(n log n)`

. And I don't like leetcode rewarding me for the slowest submission ever!

### 3. Using a constant array

Whenever I see the constraints are too small, my mind automatically starts thinking of having a constant array. We can replace the hashmap with a constant array here.

Ummm, can I do it one pass only? let's try!

`class Solution {public: int sumOfUnique(vector<int>& nums) { int res = 0; int arr[101] = {0}; for(int num: nums) { if(arr[num] == 0) { res += num; arr[num]++; } else if(arr[num] == 1) { res -= num; arr[num] = -1; } } return res; }};`

So, what I am doing here?

- Keep a constant array of length 101
- If, number is not repeated, add it to final result and increase the count
- If number is repeated, I deduct that number and assign the count of that number to -1 (means I don't want to see this again in my life)

Pretty simple right?

Oh man, I just checked this guy has 7 solutions for this problem.

As always, if you have any thoughts about anything shared above, don't hesitate to reach out.

You might like previous editions of my coding diary

- Day #16 - Best Time to Buy and Sell Stock.
- Day #15 - Count Number of Pairs With Absolute Difference K.
- Day #14 - Minimum Number of Operations to Move All Balls to Each Box.
- Day #13 - Number Of Rectangles That Can Form The Largest Square.
- Day #12 - Unique Morse Code Words.
- Day #11 - Count the Number of Consistent Strings.
- Day #10 - Find Greatest Common Divisor of Array.