260. Single Number III - LeetCode Solution


Bit Manupilation

Python Code:

class Solution:
    def singleNumber(self, nums: List[int]) -> List[int]:
        
        d = {}
        
        for i in nums:
            if i in d:
                d[i]+= 1
            else:
                d[i] = 1
        
        s = []
        
        for i in d:
            if d[i] ==1:
                s.append(i)
        
        return s


Comments

Submit
0 Comments
More Questions

1713C - Build Permutation
1699A - The Third Three Number Problem
1617B - GCD Problem
841A - Generous Kefa
1690B - Array Decrements
1692C - Where's the Bishop
104A - Blackjack
1438A - Specific Tastes of Andre
1711C - Color the Picture
1194C - From S To T
110B - Lucky String
1114A - Got Any Grapes
224B - Array
125B - Simple XML
567B - Berland National Library
431B - Shower Line
282C - XOR and OR
1582B - Luntik and Subsequences
609A - Флеш-карты
1207A - There Are Two Types Of Burgers
371C - Hamburgers
343B - Alternating Current
758B - Blown Garland
1681B - Card Trick
1592A - Gamer Hemose
493D - Vasya and Chess
1485A - Add and Divide
337B - Routine Problem
1392D - Omkar and Bed Wars
76E - Points