Adding Modified Bad Solution - Problem - 448 - Find Numbers Disappeared Array

Author: Vanditg

Find_NumberS_Disappeared _Array/ModifiedBadSolution.py

@@ -0,0 +1,25 @@
+##==================================
+## Leetcode
+## Student: Vandit Jyotindra Gajjar
+## Year: 2020
+## Problem: 448
+## Problem Name: Final All Numbers Disappeared in an Array           
+##===================================
+#
+#Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), 
+#some elements appear twice and others appear once.
+#
+#Find all the elements of [1, n] inclusive that do not appear in this array.
+#
+#Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
+#
+#Example:
+#
+#Input:
+#[4,3,2,7,8,2,3,1]
+#
+#Output:
+#[5,6]
+class Solution:
+    def findDisappearedNumbers(self, nums):
+        return list(set([i for i in range(1, len(nums) + 1, 1)]) - set(nums))	#Return the disappeared numbers