Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 18 MB (8.51%)

Author: jimit105

1848-sum-of-unique-elements/README.md

@@ -0,0 +1,36 @@
+<p>You are given an integer array <code>nums</code>. The unique elements of an array are the elements that appear <strong>exactly once</strong> in the array.</p>
+
+<p>Return <em>the <strong>sum</strong> of all the unique elements of </em><code>nums</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3,2]
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> The unique elements are [1,3], and the sum is 4.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,1,1,1]
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> There are no unique elements, and the sum is 0.
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3,4,5]
+<strong>Output:</strong> 15
+<strong>Explanation:</strong> The unique elements are [1,2,3,4,5], and the sum is 15.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
+</ul>

1848-sum-of-unique-elements/solution.py

@@ -0,0 +1,16 @@
+# Time: O(n)
+# Space: O(n)
+
+from collections import Counter
+
+class Solution:
+    def sumOfUnique(self, nums: List[int]) -> int:
+        counter = Counter(nums)
+
+        total = 0
+        for key, value in counter.items():
+            if value == 1:
+                total += key
+        
+        return total
+