Single Number III

Author: anantkaushik

260-single-number-iii.py

@@ -0,0 +1,28 @@
+"""
+Problem Link: https://leetcode.com/problems/single-number-iii/
+
+Given an array of numbers nums, in which exactly two elements appear only once and all the 
+other elements appear exactly twice. Find the two elements that appear only once.
+
+Example:
+Input:  [1,2,1,3,2,5]
+Output: [3,5]
+
+Note:
+The order of the result is not important. So in the above example, [5, 3] is also correct.
+Your algorithm should run in linear runtime complexity. Could you implement it using only 
+constant space complexity?
+"""
+class Solution:
+    def singleNumber(self, nums: List[int]) -> List[int]:
+        xor = 0
+        for no in nums:
+          xor ^= no
+        res = [0, 0]
+        xor &= -xor
+        for no in nums:
+          if xor & no == 0:
+            res[0] ^= no
+          else:
+            res[1] ^= no
+        return res