Leetcode 1748. Sum of Unique Elements

Return the sum of all array elements that occur exactly once by identifying values with frequency equal to one (i.e., sum elements whose count is 1). Constraints: n ≤ 100 and nums[i] in [1,100], so simple frequency counting suffices.