Create November-27.c

Author: Hunterdii

November 2024 GFG SOLUTION/November-27.c

@@ -0,0 +1,65 @@
+//{ Driver Code Starts
+#include <limits.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+
+// } Driver Code Ends
+// User function Template for C
+
+// Function to find the smallest positive number missing from the array.
+int missingNumber(int arr[], int n) {
+    for (int i = 0; i < n; i++) {
+        while (arr[i] > 0 && arr[i] <= n && arr[i] != arr[arr[i] - 1]) {
+            int temp = arr[i];
+            arr[i] = arr[arr[i] - 1];
+            arr[temp - 1] = temp;
+        }
+    }
+    for (int i = 0; i < n; i++) {
+        if (arr[i] != i + 1) {
+            return i + 1; 
+        }
+    }
+    return n + 1;
+}
+
+
+//{ Driver Code Starts.
+
+int main() {
+    char ts[1001];
+    fgets(ts, sizeof(ts), stdin);
+    int t = atoi(ts);
+    while (t--) {
+        char *line = NULL;
+        size_t len = 0;
+        long read = getline(&line, &len, stdin);
+
+        int *nums = (int *)malloc(1000000 * sizeof(int));
+        int n = 0;
+        char *token = strtok(line, " ");
+        while (token != NULL) {
+            nums[n++] = atoi(token);
+            token = strtok(NULL, " "); // Get the next token
+        }
+        int arr[n];
+        for (int i = 0; i < n; i++) {
+            arr[i] = nums[i];
+        }
+        // char ch;
+        // scanf("%c", &ch);
+        // getchar();
+        // Check if the array is sorted using the previously defined function
+        int ans = missingNumber(arr, n);
+        printf("%d\n", ans);
+
+        printf("%s\n", "~");
+        free(nums); // Free dynamically allocated memory for the nums array
+        free(line); // Free dynamically allocated memory for the input line
+    }
+
+    return 0; // Return 0 to indicate successful execution
+}
+// } Driver Code Ends