Sum of Unique Elements Problem

Sum of Unique Elements Problem — ExecCode Easy DSA Practice

Solve the Sum of Unique Elements problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an integer array nums. Your task is to compute the required answer and return the sum of all the unique elements of nums. The unique elements of an array are the elements that appear exactly once in the array.

Examples

Input {"nums": [1, 2, 3, 2]}; Output 4. Input {"nums": [1, 1, 1, 1, 1]}; Output 0

Constraints

1 <= nums.length <= 100 1 <= nums[i] <= 100

Practice Sum of Unique Elements free on ExecCode. Browse DSA problems, topic map, and placement guides.