From 6eb65660ec665eb62e6558908904d6d9a1a701bd Mon Sep 17 00:00:00 2001
From: BIJALWAN <82748342+ManshiBijalwan@users.noreply.github.com>
Date: Sat, 20 Nov 2021 13:36:11 +0530
Subject: [PATCH 1/2] Create README.md

---
 Manshibijalwan/README.md | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 Manshibijalwan/README.md

diff --git a/Manshibijalwan/README.md b/Manshibijalwan/README.md
new file mode 100644
index 0000000..05e1f5d
--- /dev/null
+++ b/Manshibijalwan/README.md
@@ -0,0 +1 @@
+Solutions for the third milestone.

From 38db6b9d9ea8f1d9c4be79c752c24e15e7133ac9 Mon Sep 17 00:00:00 2001
From: BIJALWAN <82748342+ManshiBijalwan@users.noreply.github.com>
Date: Sat, 20 Nov 2021 13:37:46 +0530
Subject: [PATCH 2/2] Add files via upload

---
 Manshibijalwan/Q1_MILESTONE3.txt | 81 ++++++++++++++++++++++++++++++++
 Manshibijalwan/Q2_MILESTONE3.txt | 27 +++++++++++
 Manshibijalwan/Q3_MILESTONE3.txt | 19 ++++++++
 Manshibijalwan/Q4_MILESTONE3.txt | 22 +++++++++
 4 files changed, 149 insertions(+)
 create mode 100644 Manshibijalwan/Q1_MILESTONE3.txt
 create mode 100644 Manshibijalwan/Q2_MILESTONE3.txt
 create mode 100644 Manshibijalwan/Q3_MILESTONE3.txt
 create mode 100644 Manshibijalwan/Q4_MILESTONE3.txt

diff --git a/Manshibijalwan/Q1_MILESTONE3.txt b/Manshibijalwan/Q1_MILESTONE3.txt
new file mode 100644
index 0000000..f1cae4f
--- /dev/null
+++ b/Manshibijalwan/Q1_MILESTONE3.txt
@@ -0,0 +1,81 @@
+README: To remove duplicates from the given array, using a C++ program.
+
+#include<iostream>
+
+using namespace std;
+ 
+// Function to remove duplicate elements
+
+int removeDuplicates(int arr[], int n)
+{
+
+
+    if (n==0 || n==1)
+
+        return n;
+ 
+
+    int temp[n];
+ 
+
+    // Start traversing elements
+
+    int j = 0;
+
+    for (int i=0; i<n-1; i++)
+ 
+
+       
+
+        if (arr[i] != arr[i+1])
+
+            temp[j++] = arr[i];
+ 
+           temp[j++] = arr[n-1];
+ 
+
+    // Modify original array
+
+    for (int i=0; i<j; i++)
+
+        arr[i] = temp[i];
+ 
+
+    return j;
+}
+ 
+// Driver code
+
+int main()
+{
+
+    int arr[100],size;
+    cout<<"Enter the size of the array."<<endl;
+    cin>>size;
+    cout<<"Enter the elements of the array."<<endl;
+    
+    for (int i=0; i<size; ++i)
+    {
+      cin>>arr[i];
+    }
+
+    int k = sizeof(arr) / sizeof(arr[0]);
+ 
+
+    // removeDuplicates() returns new size of
+
+    // array.
+
+    k = removeDuplicates(arr, k);
+ 
+
+    // Print updated array
+
+    for (int i=0; i<k; i++)
+
+       cout << arr[i] << " ";
+ 
+
+    return 0;
+}
+
diff --git a/Manshibijalwan/Q2_MILESTONE3.txt b/Manshibijalwan/Q2_MILESTONE3.txt
new file mode 100644
index 0000000..0f5feb8
--- /dev/null
+++ b/Manshibijalwan/Q2_MILESTONE3.txt
@@ -0,0 +1,27 @@
+README : solution function to merge two arrays.
+
+#pragma GCC optimize("Ofast")
+#pragma GCC optimization("unroll-loops")
+
+static const int _=[](){std::ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);return 0;}();
+
+class Solution {
+public:
+  void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
+    int k = m + n - 1;
+    int i = m - 1;
+    int j = n - 1;
+
+    while (i >= 0 && j >= 0) {
+      if (nums1[i] > nums2[j]) {
+        nums1[k--] = nums1[i--];
+      } else {
+        nums1[k--] = nums2[j--];
+      }
+    }
+
+    while (j >= 0) {
+      nums1[k--] = nums2[j--];
+    }
+  }
+};
\ No newline at end of file
diff --git a/Manshibijalwan/Q3_MILESTONE3.txt b/Manshibijalwan/Q3_MILESTONE3.txt
new file mode 100644
index 0000000..176203e
--- /dev/null
+++ b/Manshibijalwan/Q3_MILESTONE3.txt
@@ -0,0 +1,19 @@
+Readme: Q3 to find longest substring without repeating characters.
+
+class Solution {
+public:
+    int lengthOfLongestSubstring(string s) {
+        int ans = 0;
+        unordered_map<char, int> map;
+
+        for(int i = 0, j = 0; j < s.size(); j++){
+            if(map.find(s[j]) != map.end()){
+                i = max(map[s[j]], i);
+            }
+            ans = max(ans, j - i + 1);
+            map[s[j]] = j + 1;
+        }
+
+        return ans;
+    }
+};
diff --git a/Manshibijalwan/Q4_MILESTONE3.txt b/Manshibijalwan/Q4_MILESTONE3.txt
new file mode 100644
index 0000000..b2e254e
--- /dev/null
+++ b/Manshibijalwan/Q4_MILESTONE3.txt
@@ -0,0 +1,22 @@
+
+README: To find the contiguous subarray with length equal to k
+
+
+
+
+double findMaxAverage1(vector<int>& nums, int k)
+    {
+        int n = nums.size();
+        vector<double>sum(n + 1,0);
+        for (int i = 0; i < n; i++)sum[i + 1] = sum[i] + nums[i];
+        double ret = -1e4;
+        for (int i = 0; i <= n - k;i++)
+        {
+            for (int rep = k; rep+ i <= n;rep++)
+            {
+                //ret = max(ret,(sum[i+rep]-sum[i])/rep);//time out. . .
+                if (ret*rep < (sum[i + rep] - sum[i]))ret = (sum[i + rep] - sum[i])/rep;
+            }
+        }
+        return ret;
+    }