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.

Asked at:

collectors

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid September, 2025

collectors

Senior

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1748. Sum of Unique Elements

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact