Tap here to switch tabs
Problem
Submissions

Problem: Sum of Unique Elements

Try to solve the Sum of Unique Elements problem.

Statement

You are given an integer array nums. The unique elements of an array are the elements that appear exactly once in that array.

Return the sum of all unique elements in nums.

Constraints:

  • 1≤1 \le nums.length ≤100\le 100

  • 1≤1 \le nums[i] ≤100\le 100

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Sum of Unique Elements

Try to solve the Sum of Unique Elements problem.

Statement

You are given an integer array nums. The unique elements of an array are the elements that appear exactly once in that array.

Return the sum of all unique elements in nums.

Constraints:

  • 1≤1 \le nums.length ≤100\le 100

  • 1≤1 \le nums[i] ≤100\le 100