1748. Sum of Unique Elements - LeetCode Solution


Array Hash Table

Python Code:

class Solution:
    def sumOfUnique(self, nums: List[int]) -> int:
        a = {}
        
        for i in nums:
            if i in a:
                a[i] +=1
            else:
                a[i] =1
        
        d = 0
        for i in a:
            if a[i] == 1:
                d+=i
        
        return d
        


Comments

Submit
0 Comments
More Questions

1279B - Verse For Santa
202A - LLPS
978A - Remove Duplicates
1304A - Two Rabbits
225A - Dice Tower
1660D - Maximum Product Strikes Back
1513A - Array and Peaks
1251B - Binary Palindromes
768B - Code For 1
363B - Fence
991B - Getting an A
246A - Buggy Sorting
884A - Book Reading
1180A - Alex and a Rhombus
445A - DZY Loves Chessboard
1372A - Omkar and Completion
159D - Palindrome pairs
981B - Businessmen Problems
1668A - Direction Change
1667B - Optimal Partition
1668B - Social Distance
88B - Keyboard
580B - Kefa and Company
960A - Check the string
1220A - Cards
897A - Scarborough Fair
1433B - Yet Another Bookshelf
1283B - Candies Division
1451B - Non-Substring Subsequence
1408B - Arrays Sum