378. Unique Element Sum

Given an array of integers nums, return the sum of all elements that appear exactly once in the array. If no elements appear exactly once, return 0.

Example:
Input: nums = [1, 2, 3, 2] Output: 4 because 1 and 3 are unique.

Run this challenge interactively in Python or JavaScript when the app loads.