Create 22 July Smallest Positive Missing

Author: Chayandas07

22 July Smallest Positive Missing

@@ -0,0 +1,22 @@
+class Solution {
+  public:
+    int missingNumber(vector<int> &nums) {
+        // code here
+       int n=nums.size();
+       
+       for (int i = 0; i < n; i++) {
+            while (nums[i] > 0 && nums[i] <= n && nums[nums[i] - 1] != nums[i]) {
+                swap(nums[i], nums[nums[i] - 1]);
+            }
+        }
+
+        // Second pass: find the first index where nums[i] != i + 1
+        for (int i = 0; i < n; i++) {
+            if (nums[i] != i + 1)
+                return i + 1;
+        }
+
+        return n + 1;
+    }
+};
+