Added Day-23 Solution

Author: Gangadharbhuvan

Day-23_Single_Number_III.py

@@ -0,0 +1,19 @@
+'''
+	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):
+        s = reduce(lambda a,b: a^b, nums, 0)
+        nz = s & (s-1) ^ s
+        num1 = reduce(lambda a,b: a^(b*(b & nz == nz)), nums, 0)
+        return(num1, s ^ num1)