Generate MD files from code

Author: acesditbot

src/pages/submissions/Finding_missing_Element_from_a_range.cpp.md

@@ -0,0 +1,64 @@
+---
+extension: cpp
+author: Kasa1905
+category: Algorithms
+layout: '../../layouts/SubmissionLayout.astro'
+title: Finding_missing_Element_from_a_range
+---
+```cpp
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+// Function to find and print missing 
+// elements in the given range
+void findMissing(int arr[], int n, int low, int high) {
+    // Loop through the range of numbers from low to high
+    for (int i = low; i <= high; i++) {
+        bool found = false;
+      
+        // Loop through the array to check if i exists in it
+        for (int j = 0; j < n; j++) {
+            if (arr[j] == i) {
+                found = true;
+                break;
+            }
+        }
+      
+        // If i is not found in the array, print it
+        if (!found) {
+            cout << i << " ";
+        }
+    }
+}
+
+// Driver's code
+int main() {
+    int n, low, high;
+    
+    // Taking input for the array size
+    cout << "Enter the number of elements in the array: ";
+    cin >> n;
+    
+    vector<int> vec(n);
+    
+    // Taking input for the array elements
+    cout << "Enter the elements of the array: ";
+    for (int i = 0; i < n; i++) {
+        cin >> vec[i];
+    }
+    
+    // Taking input for the range
+    cout << "Enter the low and high values of the range: ";
+    cin >> low >> high;
+    
+    // Convert vector to array
+    int arr[n];
+    copy(vec.begin(), vec.end(), arr);
+    
+    // Function call
+    findMissing(arr, n, low, high);
+    
+    return 0;
+}```

src/pages/submissions/Finding_missing_element_from_a_range.java.md

@@ -0,0 +1,59 @@
+---
+extension: java
+author: Kasa1905
+category: Algorithms
+layout: '../../layouts/SubmissionLayout.astro'
+title: Finding_missing_element_from_a_range
+---
+```java
+import java.util.*;
+
+public class Finding_missing_element_from_a_range {
+    // Function to find and print missing elements in the given range
+    static void findMissing(int[] arr, int n, int low, int high) {
+        // Loop through the range of numbers from low to high
+        for (int i = low; i <= high; i++) {
+            boolean found = false;
+            // Loop through the array to check if i exists in it
+            for (int j = 0; j < n; j++) {
+                if (arr[j] == i) {
+                    found = true;
+                    break;
+                }
+            }
+
+            // If i is not found in the array, print it
+            if (!found) {
+                System.out.print(i + " ");
+            }
+        }
+    }
+
+    // Driver's code
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+
+        // Input for the size of the array
+        System.out.print("Enter the number of elements in the array: ");
+        int n = scanner.nextInt();
+        int[] arr = new int[n];
+
+        // Input for the array elements
+        System.out.println("Enter the elements of the array:");
+        for (int i = 0; i < n; i++) {
+            arr[i] = scanner.nextInt();
+        }
+
+        // Input for the range
+        System.out.print("Enter the low value of the range: ");
+        int low = scanner.nextInt();
+        System.out.print("Enter the high value of the range: ");
+        int high = scanner.nextInt();
+
+        // Function call
+        System.out.println("Missing elements in the range " + low + " to " + high + ":");
+        findMissing(arr, n, low, high);
+
+        scanner.close();
+    }
+}```