424. Distinct Element Sum Frequency

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

Example:
Input: nums = [1, 2, 3, 2]
Output: 4
Explanation: 1 and 3 appear once. 1 + 3 = 4.

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