Time: 152 ms (39.76%), Space: 17.7 MB (81.86%) - LeetHub

Author: mardavsj

0268-missing-number/0268-missing-number.py

@@ -0,0 +1,9 @@
+class Solution:
+    def missingNumber(self, nums: List[int]) -> int:
+        xor1=0
+        xor2=0
+        n=len(nums)
+        for i in range(n):
+            xor1^=nums[i]
+            xor2^=i+1
+        return xor1^xor2