Merge pull request #313 from abdzitter/master

Codes added

Author: SR-Sunny-Raj

04. Arrays/First Repeating Element.cpp

@@ -0,0 +1,37 @@
+#include <iostream>
+#include "bits/stdc++.h"
+using namespace std;
+
+int main() 
+{
+	int n;
+	cin >>n;
+	int a[n];
+	for(int i=0;i<n;i++)
+	{
+	    cin >> a[i];
+	}
+        const int N=1e+2;
+        int indx[N];
+        int min_index=1000;
+    for(int i=0;i<N;i++)
+        {
+            indx[i]=-1;
+        }
+        for(int i=0;i<n;i++)
+        {
+            if(indx[a[i]]==-1)
+                 {
+                    indx[a[i]]=i;
+                 }
+            else
+            {
+            if(min_index >indx[a[i]])
+                {
+                    min_index=indx[a[i]];
+                }
+            }
+        }
+        cout << min_index;
+	return 0;
+}

04. Arrays/Smallest_Missing_No.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+    int n;
+	cin >>n;
+	int a[n];
+	for(int i=0;i<n;i++)
+	{
+	    cin >> a[i];
+	}
+        const int N=1e+2;
+        int indx[N];
+       
+    for(int i=0;i<N;i++)
+        {
+            indx[i]=0;
+        }
+        for(int i=0;i<n;i++)
+        {
+            if(a[i]>=0)
+            {
+            indx[a[i]]++;
+            }
+        }
+        for(int i=0;i<N;i++)
+        {
+            if(indx[i]==0)
+            {
+                cout<< i;
+                break;
+            }
+        }
+	return 0;
+}

04. Arrays/Subarray_with_Sum_k.cpp

@@ -0,0 +1,48 @@
+#include <iostream>
+using namespace std;
+
+int main() 
+{
+        int n,start=0,end,k,s,d=0;
+        cin >>n>>k;
+        int a[n];
+        for(int i=0;i<n;i++)
+        {
+            cin >> a[i];
+        }
+         int curr_sum=0;
+        for(int end=0;end<=n;)
+        {
+            if(end==n)
+            {
+            end=n-1;
+            d++;
+            }
+            if(curr_sum < k)
+            {
+                curr_sum=curr_sum+a[end];
+                end++;
+            }
+            else if(curr_sum > k)
+            {
+               
+                curr_sum=curr_sum-a[start];
+                 start=start+1;
+                
+            }
+            else if(curr_sum==k)
+            {
+                if(d==0)
+                {
+              s=end-1;
+                }
+                if(d!=0)
+                {
+                s=n-1;
+                }
+              end=n+1;
+            }
+        }
+        cout <<start <<" "<<s;
+	return 0;
+}

07. Matrix/Searching in 2D Arraay.cpp

@@ -0,0 +1,28 @@
+ #include <iostream>
+using namespace std;
+
+int main() 
+{
+        int n,m,k;
+        cin >>n>>m>>k;
+        int a[n][m];
+        for(int i=0;i<n;i++)
+        {
+            for(int j=0;j<m;j++)
+            {
+                cin >> a[i][j];
+            }
+        }
+        int r=0,q=m-1;
+           while(r<n&&q>=0)
+           {
+               if(a[r][q]==k)
+               cout << "FOUND";
+               else if(a[r][q]>k)
+               q--;
+               else
+               r++;
+           }
+           
+	return 0;
+}