@@ -0,0 +1,17 @@
+class Solution:
+def missingNumber(self, nums):
+i = 0
+n = len(nums)
+
+while i < n:
+j = nums[i]
+if nums[i] < n and nums[i] != nums[j]:
+nums[i], nums[j] = nums[j], nums[i]
+else:
+i += 1
+
+for i, num in enumerate(nums):
+if i != num:
+return i
+
+return n

@@ -0,0 +1,18 @@
+class Solution:
+def findDisappearedNumbers(self, nums):
+i = 0
+n = len(nums)
+
+while i < n:
+j = nums[i] - 1
+if nums[i] != nums[j]:
+nums[i], nums[j] = nums[j], nums[i]
+else:
+i += 1
+
+missing = []
+for i, num in enumerate(nums):
+if num != i + 1:
+missing.append(i + 1)
+
+return missing

@@ -0,0 +1,16 @@
+class Solution:
+def findDuplicate(self, nums):
+i = 0
+n = len(nums)
+
+while i < n:
+if nums[i] != i + 1:
+j = nums[i] - 1
+if nums[i] != nums[j]:
+nums[i], nums[j] = nums[j], nums[i]
+else:
+return nums[i]
+else:
+i += 1
+
+return -1

@@ -0,0 +1,16 @@
+class Solution:
+def findDuplicates(self, nums):
+i = 0
+while i < len(nums):
+j = nums[i] - 1
+if nums[i] != nums[j]:
+nums[i], nums[j] = nums[j], nums[i]
+else:
+i += 1
+
+duplicates = []
+for i, num in enumerate(nums):
+if nums[i] != i + 1:
+duplicates.append(num)
+
+return duplicates