Time: 48 ms (10.18%), Space: 18 MB (63.93%) - LeetHub

Author: anand-3399

268-missing-number/268-missing-number.cpp

@@ -4,10 +4,9 @@ class Solution {
 
         sort(nums.begin(),nums.end());
         for(int i = 0;i < nums.size();i++)
-        {
-            cout<<nums[i]<<" ";
-            if(nums[i] != i) return i;
-        }
+            if(nums[i] != i) 
+                return i;
+        
 
         return nums.size();
     }