diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 0000000..252b4e1
Binary files /dev/null and b/.DS_Store differ
diff --git a/17EGICS018_ARRAY_11 b/17EGICS018_ARRAY_11
new file mode 100644
index 0000000..a7cc1a4
--- /dev/null
+++ b/17EGICS018_ARRAY_11
@@ -0,0 +1,30 @@
+#include<stdio.h>
+int main()
+{
+	int i, j, k, n, sum, max = 0;
+	printf("Enter the size of the array: ");
+	scanf("\n%d",&n);
+	int a[n];
+	printf("Enter the array element: \n");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+	
+  	for(i=0; i<n; i++)
+  	{
+    	for(j=i; j<n; j++)
+    	{
+      		sum = 0;
+      		for(k=i ; k<j; k++)
+      		{
+        		sum = sum + a[k];
+      		}
+      		if(sum>max){
+      			max=sum;
+			}
+        }
+    }
+	printf("\n%d",max);
+	return 0;
+}
diff --git a/17EGICS024_Array_10.cpp b/17EGICS024_Array_10.cpp
new file mode 100644
index 0000000..60e08dc
--- /dev/null
+++ b/17EGICS024_Array_10.cpp
@@ -0,0 +1,52 @@
+#include<iostream>
+#include<conio.h>
+using namespace std;
+int main()
+{
+	int *p;
+	int n,i,target,lb,ub,mid;
+	cout<<"Enter Size of array:";
+	cin>>n;
+	p=new int[n];
+	if(n<1)
+	{
+		exit(0);
+	}
+	cout<<"\nEnter array Elements:\n";
+	for(i=0;i<n;i++)
+	{
+		cin>>p[i];
+	}
+	cout<<"\nEnter Target Value:";
+	cin>>target;
+	lb=0;
+	ub=n-1;
+	mid=(lb+ub)/2;
+	while(lb<=ub)
+	{
+		if(target==p[mid])
+		{
+			cout<<mid;
+			exit(0);
+		}
+		else if(target>p[mid])
+		{
+			lb=mid+1;
+		}
+		else
+		{
+			ub=mid-1;
+		}
+		mid=(lb+ub)/2;
+	}
+	if(target>p[ub])
+	{
+		cout<<ub+1;
+	}
+	else
+	{
+		cout<<lb-1;
+	}
+	getch();
+	return 0;
+}
diff --git a/17EGICS030_ARRAY_11.py b/17EGICS030_ARRAY_11.py
new file mode 100644
index 0000000..2b74c69
--- /dev/null
+++ b/17EGICS030_ARRAY_11.py
@@ -0,0 +1,27 @@
+#ASSIGNEMENT-5
+#Given an array of N integers, find the contiguous subarray (containing at least one number) 
+# which has the largest sum and print its sum.
+
+def maxSubarray(arr):
+    sum=0
+    maxSum=max(arr)
+    subArray=[]
+    for ele in arr:
+        sum += ele
+        if(sum<0):
+            sum=0
+            subArray=[]
+        if(maxSum<sum):
+            maxSum=sum
+    print("SUBARRAY IS: ",subArray)
+    return maxSum
+
+size=int(input(("Enter the size of array: ")))
+s=size
+arr=[]
+
+for i in range(size):
+    num=int(input())
+    arr.append(num)
+
+print("MAXIMUM SUM: ",maxSubarray(arr))
\ No newline at end of file
diff --git a/17EGICS030_ARRRAY_10.py b/17EGICS030_ARRRAY_10.py
new file mode 100644
index 0000000..bd5e275
--- /dev/null
+++ b/17EGICS030_ARRRAY_10.py
@@ -0,0 +1,35 @@
+#ASSIGNMENT 5
+#Given an array of N integers and a target value, print the index if the target is found. 
+# If not, print the index where it would be if it were inserted in order.
+# You may assume no duplicates in the array.
+
+index=0
+n=int(input(("Enter the size of array: ")))
+t=int(input("Enter the target value: "))
+print("Enter the array elements: ")
+flag=False
+arr=[]
+
+for i in range(n):
+    num=int(input())
+    arr.append(num)
+    if not flag:
+        if (arr[i] == t):
+            flag=True
+            index=i
+        if arr[i-1]<t and arr[i]>t:
+            flag=True
+            n=n+1
+            arr.insert(i,t)
+            index=i
+if not flag and arr[n-1]<t:
+    arr.append(t)
+    index=n
+    flag=True
+elif not flag and arr[0]>t:
+    arr.insert(0,t)
+    index=0
+    flag=True
+
+print(arr)
+print("INDEX OF TARGET VALUE IN ARRAY: ",index)
diff --git a/17EGICS057_array_11 b/17EGICS057_array_11
new file mode 100644
index 0000000..dfeb15b
--- /dev/null
+++ b/17EGICS057_array_11
@@ -0,0 +1,26 @@
+#include<stdio.h>
+void main()
+{
+	int n,i;
+	printf("enter size of array");
+	scanf("%d",&n);
+	int a[n],curr_sum=0,max_sum=0;
+	printf("enter array elements\n");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+	for(i=0;i<n;i++)
+	{
+		curr_sum=curr_sum+a[i];
+		if(curr_sum<0)
+		{
+			curr_sum=0;
+		}
+		else if(max_sum<curr_sum)
+		{
+			max_sum=curr_sum;
+		}
+	}
+	printf("%d",max_sum);
+}
diff --git a/17EGICS077_assignment5_Q10 b/17EGICS077_assignment5_Q10
new file mode 100644
index 0000000..6abb0d4
--- /dev/null
+++ b/17EGICS077_assignment5_Q10
@@ -0,0 +1,26 @@
+#include<stdio.h>
+int main()
+{
+	int l,i,t;
+	printf("LENGHT OF ARRAY: ");
+	scanf("%d",&l);
+	int x[l];
+	printf("TARGET VALUE: ");
+	scanf("%d",&t);
+	printf("ENTER ARRAY ELEMENT :\n");
+	for(i=0;i<l;i++)
+	{
+		scanf("%d",&x[i]);
+	}
+	for(i=0;i<l;i++)
+	{
+		if(t==x[i])
+		{
+			printf("postion is %d of element %d ",i,x[i]);
+		}
+		else if(t>x[i] && t<x[i+1])
+		{
+			printf("element %d is enter on postion %d",t,(i+1));
+		}
+	}
+}
diff --git a/17EGICS077_assignment5_Q11 b/17EGICS077_assignment5_Q11
new file mode 100644
index 0000000..5b279ac
--- /dev/null
+++ b/17EGICS077_assignment5_Q11
@@ -0,0 +1,27 @@
+#include<stdio.h>
+int main()
+{
+	int k=0,i,l,j,sum;
+	printf("LENGHT OF ARRAY: ");
+	scanf("%d",&l);
+	int x[l];
+	printf("ENTER ARRAY ELEMENT :\n");
+	for(i=0;i<l;i++)
+	{
+		scanf("%d",&x[i]);
+	}
+	for(i=0;i<l;i++)
+	{
+		sum=0;
+		sum=x[i];
+		for(j=i+1;j<l;j++)
+		{
+			sum=sum+x[j];
+			if(k<sum)
+			{
+				k=sum;
+			}
+		}
+	}
+	printf("%d",k);
+}
diff --git a/17EGICS121_ARRAY_ASSIGNMENT_2(1).txt b/17EGICS121_ARRAY_ASSIGNMENT_2(1).txt
new file mode 100644
index 0000000..9bf2e44
--- /dev/null
+++ b/17EGICS121_ARRAY_ASSIGNMENT_2(1).txt
@@ -0,0 +1,28 @@
+#include<stdio.h>
+int main()
+{
+    int i,j,n=0;
+    int flag;
+    printf("\nenter no of elements:");
+    scanf("%d",&n);
+    int a[n];
+    for (i=0; i<n; i++) {
+        scanf("%d",&a[i]);
+    }
+    for (i=0; i<n; i++)
+    {
+        flag = 1;
+        for(j=0;j<n;j++)
+        {
+            if(a[i] == a[j]&&i!=j)
+            {
+                flag = 0;
+            }
+        }
+        if(flag == 1)
+        {
+            printf("\nnon-repeating element is: '%d'\n",a[i]);
+        }
+    }
+    return 0;
+}
diff --git a/17EGICS121_ARRAY_ASSIGNMENT_2(2).txt b/17EGICS121_ARRAY_ASSIGNMENT_2(2).txt
new file mode 100644
index 0000000..14a8379
--- /dev/null
+++ b/17EGICS121_ARRAY_ASSIGNMENT_2(2).txt
@@ -0,0 +1,35 @@
+#include <stdio.h>
+#include <string.h>
+int main()
+{
+    int i,j,n,s;
+    char temp;
+    printf("\nenter no of chars: ");
+    scanf("%d",&n);
+    char a[n];
+    printf("\nenter string: ");
+    scanf("%s",&a);
+    //it is assumed that characters will be equal to 'n' otherwise we can use 'for' loop.
+    printf("\nenter no of right shift steps: ");
+    scanf("%d",&s);
+    if(s%n==0&&(strlen(a)==n)){
+        printf("after shift: %s\n",a);
+    }
+    else{
+        while(s/n != 0){
+            printf("%d\n",s/n);
+            s=s%n;
+        }
+        
+        for(i=0;i<s;i++){
+            temp = a[n-1];
+            for (j=n-2; j>=0; j--){
+                a[j+1] = a[j];
+            }
+            a[0] = temp;
+        }
+    if(s%n!=0){
+        printf("\n\nresult: %s",a);
+    }
+}
+}
diff --git a/17EGICS121_Array_assignment_3(1).c b/17EGICS121_Array_assignment_3(1).c
new file mode 100644
index 0000000..a427bc2
--- /dev/null
+++ b/17EGICS121_Array_assignment_3(1).c
@@ -0,0 +1,24 @@
+#include <stdio.h>
+#include <string.h>
+int main()
+{
+    	int i,max1=0,max2=0,result=0,n=0;
+	printf("\n enter no of elements:");
+	scanf("%d",&n);
+	int arr[n];
+	printf("\nenter elements:");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&arr[i]);
+		if(arr[i]>max1)
+		{
+			max2=max1;
+			max1=arr[i];
+			
+		}
+		else if(max2<arr[i]){
+			max2=arr[i];
+		}
+	}
+	printf("\nmax1= %d,max2 = %d\nProduct: %d\n",max1,max2,max1*max2);
+}
diff --git a/17EGICS121_Array_assignment_3(2).c b/17EGICS121_Array_assignment_3(2).c
new file mode 100644
index 0000000..9a62239
--- /dev/null
+++ b/17EGICS121_Array_assignment_3(2).c
@@ -0,0 +1,31 @@
+#include <stdio.h>
+#include <string.h>
+int main()
+{
+    int i,num=0,sum1=0,sum2=0,count1=0,count2=0,n=0;
+	printf("\n enter no of elements:");
+	scanf("%d",&n);
+	int arr[n];
+	printf("\nenter elements:");// assuming the integers as positive numbers
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&arr[i]);
+		if(arr[i]>num)
+		{
+			sum1+=arr[i];
+			num = arr[i];
+			count1++;
+		}
+		else{
+            count1 = 1;
+            sum1 = arr[i];
+            num = arr[i];
+			}
+        if(count1>count2)
+        {
+            count2 = count1;
+            sum2 = sum1;
+		}
+	}
+	printf("\nlongest increasing order sum is: %d,&count=%d\n",sum2,count2);
+}
diff --git a/17EGICS121_Assignment_7_a.cpp b/17EGICS121_Assignment_7_a.cpp
new file mode 100644
index 0000000..08fe418
--- /dev/null
+++ b/17EGICS121_Assignment_7_a.cpp
@@ -0,0 +1,28 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int i,j,n; bool flag=false;
+    cout<<"enter no of elements:";
+    cin>>n;
+    int a[n];
+    cout<<"enter elements :\n";
+    for(i=0;i<n;i++)
+    {
+        cin>>a[i];
+    }
+    sort(a,a+n);
+    for(i=0,j=i+1;i<n;i++,j++)
+    {
+        if(a[i] == a[j])
+        {
+            flag = true; break;
+        }
+    }
+    if(flag==true){
+        cout<<"\ntrue\n";
+    }
+    else{
+        cout<<"\nfalse\n";
+    }
+}
diff --git a/17EGICS121_array_assignment_6_a.cpp b/17EGICS121_array_assignment_6_a.cpp
new file mode 100644
index 0000000..fbae98a
--- /dev/null
+++ b/17EGICS121_array_assignment_6_a.cpp
@@ -0,0 +1,31 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n,j,i,count=0;
+    cout<<"enter size=";
+    cin>>n;
+    int a[n];
+    cout<<"enter elements:";
+    for(j=0;j<n;j++)
+    {
+        cin>>a[j];
+    }
+    //Assuming the array is sorted in ascending order
+    for (i=0,j=i+1; i<n-1; i++,j++)
+    {
+        if(a[i]==a[j]){
+            if(a[j]+1==a[j+1]){
+                count++;
+            }
+            else{
+                i++;j++;
+            }
+        }
+        if(a[i]+1==a[j]){
+            count++;
+        }
+    }
+    cout<<"count="<<count;
+    return 0;
+}
diff --git a/17EGICS121_array_assignment_6_b.cpp b/17EGICS121_array_assignment_6_b.cpp
new file mode 100644
index 0000000..c45578d
--- /dev/null
+++ b/17EGICS121_array_assignment_6_b.cpp
@@ -0,0 +1,26 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n,j,i,count=0;
+    cout<<"enter size=";
+    cin>>n;
+    int a[n];
+    int target;
+    cout<<"\nenter target: ";
+    cin>>target;
+    cout<<"enter elements:";
+    for(j=0;j<n;j++)
+    {
+        cin>>a[j];
+    }
+    //Assuming the array is sorted in ascending order
+    for (i=0,j=i+1; i<n-1; i++,j++)
+    {
+        if(a[i]+a[j]==target){
+            count++;
+        }
+    }
+    cout<<"count="<<count;
+    return 0;
+}
diff --git a/17EGICS121_assignment_7_b.cpp b/17EGICS121_assignment_7_b.cpp
new file mode 100644
index 0000000..8dd22c5
--- /dev/null
+++ b/17EGICS121_assignment_7_b.cpp
@@ -0,0 +1,84 @@
+#include <iostream>
+#include <cstring>
+#include <string>
+using namespace std;
+int main()
+{
+    int i,j=0;
+    string a,b;
+    cout<<"enter pattern:";
+    getline(cin, b);
+    cout<<"enter string:";
+    getline(cin, a);
+    char first = b[0],second = ' ';
+    string word = "";
+    string word1 = "";
+    string word2 = "";
+    bool flag = true;
+    //assuming string pattern of two different words only. i.e., only two character will be there in pattern (like a,b)
+    for (i=1; i<strlen(a.c_str()); i++) {
+        if(b[i] != first)
+        {
+            second = b[i]; break;
+        }
+    }
+    for (auto x: a)
+    {
+        if (x == ' ')
+        {
+            if(word1 == "")
+            {
+                word1 = word;
+                word = "";
+            }
+            else{
+                word2 = word;
+                word = ""; break;
+            }
+        }
+        else
+        {
+            word += x;
+        }
+    }
+    for(i=0,j=0; i<strlen(a.c_str()); i++)
+    {
+        if (a[i] == ' ')
+        {
+            if(b[j]== first)
+            {
+                cout<<"compare: "<<word<<","<<word1;
+                if(strcmp(word.c_str(),word1.c_str()) == 1)
+                {
+                    flag=false; break;
+                }
+                word = "";
+                j++;
+            }
+            else if(b[j] == second)
+            {
+                cout<<"compare: "<<word<<","<<word2;
+                if(strcmp(word.c_str(),word2.c_str()) == 1)
+                {
+                    flag=false; break;
+                }
+                word = "";
+                j++;
+            }
+            else{
+                word2 = word;
+                word = "";
+            }
+        }
+        else{
+            word += a[i];
+        }
+    }
+    if(flag == true)
+    {
+        cout<<"\nit follows the pattern\n";
+    }
+    else{
+        cout<<"\nit doesn't follows the pattern\n";
+    }
+}
diff --git a/Array/.DS_Store b/Array/.DS_Store
new file mode 100644
index 0000000..a37d6ec
Binary files /dev/null and b/Array/.DS_Store differ
diff --git a/Array/17EGICS018_ARRAY_3.c b/Array/17EGICS018_ARRAY_3.c
new file mode 100644
index 0000000..bd24ef2
--- /dev/null
+++ b/Array/17EGICS018_ARRAY_3.c
@@ -0,0 +1,35 @@
+#include<stdio.h>
+void main()
+{
+	int n;
+	printf("Enter the size of an array:");
+	scanf("%d",&n);
+	int a[50],b[50],i,j,c;
+	printf("Enter array elements: \n");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+		b[i] = -1;
+	}
+	for(i=0;i<n;i++)
+	{
+		c=1;
+		for(j=i+1;j<n;j++)
+		{
+			if(a[i]==a[j]){
+				c++;
+				b[j] = 0;
+			}
+		}
+		if(b[i]!=0){
+			b[i] = c;
+		}
+	}
+	for(i=0;i<n;i++)
+	{
+		if(b[i] == 1)
+		{
+			printf("\n%d",a[i]);
+		}
+	}
+}
diff --git a/Array/17EGICS018_ARRAY_6.c b/Array/17EGICS018_ARRAY_6.c
new file mode 100644
index 0000000..344c053
--- /dev/null
+++ b/Array/17EGICS018_ARRAY_6.c
@@ -0,0 +1,40 @@
+#include<stdio.h>
+void main()
+{
+	int n, fmax, smax, i, j, m;
+	printf("Enter the no of input: \n");
+	scanf("%d",&n);
+	int a[n];
+	printf("Enter inputs: \n");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+	if(n>2)
+	{
+		if(a[1]>a[0]){
+			fmax=a[1];
+			smax=a[0];
+		}
+		else{
+			fmax=a[0];
+			smax=a[1];
+		}
+		for(i=2;i<n;i++)
+		{
+			if(a[i]>fmax){
+				smax=fmax;
+				fmax=a[i];
+			}
+			else if(a[i]>smax){
+				smax=a[i];
+			}
+		}
+		m=fmax*smax;
+		printf("\n%d",m);
+	}
+	else
+	{
+		printf("Please,enter valid no of inputs.");
+	}
+}
diff --git a/17EGICS019_Array_1.py b/Array/17EGICS019_Array_1.py
similarity index 100%
rename from 17EGICS019_Array_1.py
rename to Array/17EGICS019_Array_1.py
diff --git a/Array/17EGICS019_Array_10.py b/Array/17EGICS019_Array_10.py
new file mode 100644
index 0000000..f320fac
--- /dev/null
+++ b/Array/17EGICS019_Array_10.py
@@ -0,0 +1,19 @@
+try:
+    n = int(input("Enter Length of Array : "))
+    arr = []
+    t = int(input("Enter the target element : "))
+    print("Enter Array Elements :")
+    for i in range(n):
+        arr.append(int(input()))
+    if t < arr[0]:
+        res = 0
+    elif t > arr[-1]:
+        res = len(arr)
+    else:
+        for i in range(n):
+            if arr[i] == t or (i and arr[i] > t and arr[i-1] < t):
+                res = i
+                break
+    print("\nIndex :", res)
+except:
+    print("Please provide valid inputs!")
\ No newline at end of file
diff --git a/Array/17EGICS019_Array_11.py b/Array/17EGICS019_Array_11.py
new file mode 100644
index 0000000..08fff20
--- /dev/null
+++ b/Array/17EGICS019_Array_11.py
@@ -0,0 +1,18 @@
+try:
+    n = int(input("Enter Length of Array : "))
+    arr = []
+    print("Enter Array Elements :")
+    for i in range(n):
+        arr.append(int(input()))
+    maximum, continuous = 0, 0
+    for i in range(len(arr)):
+        if continuous + arr[i] > 0:
+            continuous += arr[i]
+            if continuous > maximum:
+                maximum = continuous
+        else:
+            continuous = 0
+            i += 1
+    print("\nSum :", maximum)
+except:
+    print("Please provide valid inputs!")
\ No newline at end of file
diff --git a/17EGICS019_Array_2.py b/Array/17EGICS019_Array_2.py
similarity index 100%
rename from 17EGICS019_Array_2.py
rename to Array/17EGICS019_Array_2.py
diff --git a/Array/17EGICS019_Array_3.py b/Array/17EGICS019_Array_3.py
new file mode 100644
index 0000000..81e53b5
--- /dev/null
+++ b/Array/17EGICS019_Array_3.py
@@ -0,0 +1,18 @@
+try:
+    n = int(input("Enter Length of Array : "))
+    if n%2 != 0:
+        arr = []
+        print("Enter Array Elements :")
+        for i in range(n):
+            arr.append(int(input()))
+        for i in arr:
+            if arr.count(i) == 1:
+                print("\nNon-Repeating Element : ", i)
+                break
+            if arr.count(i) > 2:
+                print("\nPlease check your array input!")
+                break
+    else:
+        print("n must be an odd number!")
+except:
+    print("Please provide valid inputs!")
\ No newline at end of file
diff --git a/Array/17EGICS019_Array_4.py b/Array/17EGICS019_Array_4.py
new file mode 100644
index 0000000..1475687
--- /dev/null
+++ b/Array/17EGICS019_Array_4.py
@@ -0,0 +1,12 @@
+try:
+    n = int(input("Enter Length of Array : "))
+    arr = input("Enter Array of Charancters : ")
+    if len(arr) == n:
+        s = int(input("Right Shift by : "))
+        for i in range(s):
+            arr = arr[-1:] + arr[:-1]
+        print("\nArray after %d Right Shift(s) : %s" %(s, arr))
+    else:
+        print("Please check the length of array!")
+except:
+    print("Please provide valid inputs!")
\ No newline at end of file
diff --git a/Array/17EGICS019_Array_5.py b/Array/17EGICS019_Array_5.py
new file mode 100644
index 0000000..8c97d30
--- /dev/null
+++ b/Array/17EGICS019_Array_5.py
@@ -0,0 +1,23 @@
+try:
+    n = int(input("Enter Length of Array : "))
+    arr = []
+    print("Enter Array Elements :")
+    for i in range(n):
+        arr.append(int(input()))
+    subseq = {}
+    start = end = 0
+    for i in range(len(arr)):
+        if i and arr[i-1] >= arr[i]:
+            start = end
+            end = i
+        if i == len(arr)-1:
+            start = end
+            end = len(arr)
+        length = end - start
+        if subseq.get(length):
+            subseq[length] = max(subseq[length], sum(arr[start:end]))
+        else:
+            subseq[length] = sum(arr[start:end])           
+    print("\nSum : ", subseq[max(subseq.keys())])
+except:
+    print("Please provide valid inputs!")
diff --git a/Array/17EGICS019_Array_6.py b/Array/17EGICS019_Array_6.py
new file mode 100644
index 0000000..c2b26ef
--- /dev/null
+++ b/Array/17EGICS019_Array_6.py
@@ -0,0 +1,14 @@
+try:
+    n = int(input("Enter Length of Array : "))
+    arr = []
+    print("Enter Array Elements :")
+    for i in range(n):
+        arr.append(int(input()))
+    res = max(arr)
+    if arr.count(res) > 1:
+        print("\nProduct : ", res * res)
+    else:
+        arr = list(filter(res.__ne__, arr))
+        print("\nProduct : ", res * max(arr))
+except:
+    print("Please provide valid inputs!")
\ No newline at end of file
diff --git a/Array/17EGICS019_Array_7.py b/Array/17EGICS019_Array_7.py
new file mode 100644
index 0000000..786c37f
--- /dev/null
+++ b/Array/17EGICS019_Array_7.py
@@ -0,0 +1,14 @@
+try:
+    n = int(input("Enter Length of Array : "))
+    arr = []
+    print("Enter Array Elements :")
+    for i in range(n):
+        arr.append(int(input()))
+    res = []
+    for i in range(0, len(arr)-1):
+        if arr[i] > max(arr[i+1:]):
+            res.append(str(arr[i])) 
+    res.append(str(arr[-1]))
+    print("\nLEADERS are", ', '.join(res))
+except:
+    print("Please provide valid inputs!")
\ No newline at end of file
diff --git a/Array/17EGICS019_Array_8.py b/Array/17EGICS019_Array_8.py
new file mode 100644
index 0000000..6fe430a
--- /dev/null
+++ b/Array/17EGICS019_Array_8.py
@@ -0,0 +1,15 @@
+try:
+    n = int(input("Enter Length of Array : "))
+    arr = []
+    print("Enter Array Elements :")
+    for i in range(n):
+        arr.append(int(input()))
+    sum1 = arr[0]
+    sum2 = 0
+    for i in range(1, len(arr)):
+        sum3 = max(sum1, sum2)
+        sum1 = arr[i] + sum2
+        sum2 = sum3
+    print("\nMaximum Sum :", max(sum1, sum2))
+except:
+    print("Please provide valid inputs!")
\ No newline at end of file
diff --git a/Array/17EGICS019_Array_9.py b/Array/17EGICS019_Array_9.py
new file mode 100644
index 0000000..a2cf3c9
--- /dev/null
+++ b/Array/17EGICS019_Array_9.py
@@ -0,0 +1,18 @@
+try:
+    n = int(input("Enter Length of Array : "))
+    arr = []
+    print("Enter Array Elements :")
+    for i in range(n):
+        arr.append(int(input()))
+    prod = [1] * n
+    t = 1
+    for i in range(n):
+        prod[i] = t
+        t *= arr[i]
+    t = 1
+    for i in range(n-1, -1, -1):
+        prod[i] *= t
+        t *= arr[i]
+    print("\nProduct Array : ", prod)
+except:
+    print("Please provide valid inputs!")
\ No newline at end of file
diff --git a/Array/17EGICS024_ARRAY_6.cpp b/Array/17EGICS024_ARRAY_6.cpp
new file mode 100644
index 0000000..65ab96b
--- /dev/null
+++ b/Array/17EGICS024_ARRAY_6.cpp
@@ -0,0 +1,35 @@
+#include<iostream>
+#include<conio.h>
+using namespace std;
+int main()
+{
+	int *p;
+	int n,i,j,max,product;
+	cout<<"Enter Size of array:";
+	cin>>n;
+	p=new int[n];
+	if(n<1)
+	{
+		exit(0);
+	}
+	cout<<"\nEnter array Elements:\n";
+	for(i=0;i<n;i++)
+	{
+		cin>>p[i];
+	}
+	max=p[0]*p[1];
+	for(i=0;i<n;i++)
+	{
+		for(j=i+1;j<n;j++)
+		{
+			product=p[i]*p[j];
+		}
+		if(product>max)
+		{
+			max=product;
+		}
+	}
+	cout<<max;
+	getch();
+	return 0;
+}
diff --git a/Array/17EGICS024_Array_3.cpp b/Array/17EGICS024_Array_3.cpp
new file mode 100644
index 0000000..82afab0
--- /dev/null
+++ b/Array/17EGICS024_Array_3.cpp
@@ -0,0 +1,38 @@
+#include<iostream>
+#include<conio.h>
+using namespace std;
+int main()
+{
+	int *p;
+	int n,i,j,count;
+	cout<<"Enter Size of array:";
+	cin>>n;
+	p=new int[n];
+	if(n<1)
+	{
+		exit(0);
+	}
+	cout<<"\nEnter array Elements:\n";
+	for(i=0;i<n;i++)
+	{
+		cin>>p[i];
+	}
+	for(i=0;i<n;i++)
+	{
+		count=0;
+		for(j=0;j<n;j++)
+		{
+			if(p[i]==p[j])
+			{
+				count++;	
+			}
+		}
+		if(count==1)
+		{
+			cout<<p[i];
+			break;
+		}
+	}
+	getch();
+	return 0;
+}
diff --git a/Array/17EGICS030_ARRAY_3.py b/Array/17EGICS030_ARRAY_3.py
new file mode 100644
index 0000000..d50b58c
--- /dev/null
+++ b/Array/17EGICS030_ARRAY_3.py
@@ -0,0 +1,15 @@
+#Given an array of N integers, every element appears twice except for one .
+#Print the non repeating element .
+def nonRepeating(arr):
+    for i in arr:
+        if arr.count(i)<2:
+            return i
+
+size=int(input(("Enter the size of array: ")))
+s=size
+arr=[]
+while size != 0:
+    num=int(input())
+    arr.append(num)
+    size=size-1
+print("NON REPEATING ELEMENT IS ",nonRepeating(arr))
\ No newline at end of file
diff --git a/Array/17EGICS030_ARRAY_4.py b/Array/17EGICS030_ARRAY_4.py
new file mode 100644
index 0000000..06a827c
--- /dev/null
+++ b/Array/17EGICS030_ARRAY_4.py
@@ -0,0 +1,29 @@
+#Given a character array of size N. You have to perform the right shift by s places.
+
+#SOLUTION 1
+#  def rightShift(arr,rt):
+#     while rt != 0:
+#         p=arr.pop()
+#         arr.insert(0,p)
+#         rt=rt-1
+#     return arr
+
+#SOLUTION 2
+def rightShift(arr,rt):
+    while rt>len(arr):
+        rt-=len(arr)
+    s1=arr[rt:]
+    s2=arr[0:rt]
+    s=s1+s2
+    return s
+
+size=int(input(("Enter the size of array: ")))
+s=size
+arr=[]
+while size != 0:
+    c=input()
+    arr.append(c)
+    size=size-1
+rt=int(input("Enter the number of right shifts to be done: "))
+print("AFTER PERFORMING RIGHT SHIFT, ARRAY BECOMES: ")
+print("".join(rightShift(arr,rt)))
diff --git a/Array/17EGICS030_ARRAY_5.py b/Array/17EGICS030_ARRAY_5.py
new file mode 100644
index 0000000..09638d6
--- /dev/null
+++ b/Array/17EGICS030_ARRAY_5.py
@@ -0,0 +1,28 @@
+#Given an unsorted array of integers, find the sum of longest Continuous increasing     
+# subsequence.
+
+#LOGIC
+def longestSubsequence(arr):
+    s=arr[0]
+    sum1=0
+    for i in range(len(arr)-1):
+        if arr[i]<arr[i+1]:
+            s+=arr[i+1]
+            if s>sum1:
+                sum1=s
+        else:
+            if s>sum1:
+                sum1=s
+            s=arr[i+1]
+    print(sum1)
+    return sum1
+
+#INPUT CODE
+size=int(input(("Enter the size of array: ")))
+s=size
+arr=[]
+while size != 0:
+    num=int(input(" "))
+    arr.append(num)
+    size=size-1
+print("SUM OF LONGEST SUBSEQUENCE IS: ",longestSubsequence(arr))
\ No newline at end of file
diff --git a/Array/17EGICS030_ARRAY_6.py b/Array/17EGICS030_ARRAY_6.py
new file mode 100644
index 0000000..f7012a9
--- /dev/null
+++ b/Array/17EGICS030_ARRAY_6.py
@@ -0,0 +1,18 @@
+#Given an array of size N. Find two elements from the array whose product is maximum.
+
+#LOGIC
+def maxProduct(arr):
+    max1=max(arr)
+    arr.remove(max1)
+    max2=max(arr)
+    return max1*max2
+
+#INPUT CODE
+size=int(input(("Enter the size of array: ")))
+s=size
+arr=[]
+while size != 0:
+    num=int(input("-"))
+    arr.append(num)
+    size=size-1
+print("MAXIMUM PRODUCT IS: ",maxProduct(arr))
\ No newline at end of file
diff --git a/Array/17EGICS030_ARRAY_7.py b/Array/17EGICS030_ARRAY_7.py
new file mode 100644
index 0000000..a3a09aa
--- /dev/null
+++ b/Array/17EGICS030_ARRAY_7.py
@@ -0,0 +1,22 @@
+# Write a program to print all the LEADERS in the array. An element is leader if it is greater 
+#than all the elements to its right side. And the rightmost element is always a leader.
+
+def leaders(arr):
+    l=[arr[-1]]
+    arr.reverse()
+    for ele in arr:
+        if ele>max(l):
+            l.append(ele)
+    l.reverse()
+    return l
+    # return l.append(ele for ele in reversed(arr) if ele>max(l))
+
+size=int(input(("Enter the size of array: ")))
+s=size
+arr=[]
+while size != 0:
+    num=int(input(" -"))
+    arr.append(num)
+    size=size-1
+print("LEADERS ARE: ",end=" ") 
+print(leaders(arr))
\ No newline at end of file
diff --git a/Array/17EGICS030_ARRAY_8.py b/Array/17EGICS030_ARRAY_8.py
new file mode 100644
index 0000000..8283114
--- /dev/null
+++ b/Array/17EGICS030_ARRAY_8.py
@@ -0,0 +1,20 @@
+#Given an array of positive numbers, find the maximum sum of a subsequence with the 
+#constraint that no 2 numbers in the sequence should not be adjacent in the array.
+
+def maxSub(arr):
+    sum=0
+    curr=arr[0]
+    for i in range(1,len(arr)):
+        res=max(sum,curr)
+        curr=arr[i]+sum
+        sum=res
+    return max(sum,curr)
+
+size=int(input(("Enter the size of array: ")))
+s=size
+arr=[]
+while size != 0:
+    num=int(input())
+    arr.append(num)
+    size=size-1
+print("MAXIMUM SUM: ",maxSub(arr))
\ No newline at end of file
diff --git a/Array/17EGICS030_ARRAY_9.py b/Array/17EGICS030_ARRAY_9.py
new file mode 100644
index 0000000..25442ae
--- /dev/null
+++ b/Array/17EGICS030_ARRAY_9.py
@@ -0,0 +1,27 @@
+#Given an array arr[] of n integers, construct a Product Array prod[] (of same size) such that 
+#prod[i] is equal to the product of all the elements of arr[] except arr[i]. Solve it without division 
+#operator and in O(n)
+
+import math
+#input
+size=int(input(("Enter the size of array: ")))
+s=size
+arr=[]
+result=[]
+
+while size != 0:
+    num=int(input())
+    arr.append(num)
+    size=size-1
+
+#logic
+copyArr=arr.copy()
+
+for i in range(len(arr)):
+    rem=arr[i]
+    copyArr.remove(rem)
+    result.append(math.prod(copyArr))
+    copyArr=arr.copy()
+
+print("RESULTANT ARRAY IS :- ")
+print(result)
diff --git a/Array/17EGICS031_ARRAY_3.py b/Array/17EGICS031_ARRAY_3.py
new file mode 100644
index 0000000..f8d1a96
--- /dev/null
+++ b/Array/17EGICS031_ARRAY_3.py
@@ -0,0 +1,21 @@
+def non_repeating(list,n):
+    for i in range(n): 
+        j = 0
+        while(j < n): 
+            if (i != j and list[i] == list[j]): 
+                break
+            j += 1
+        if (j == n): 
+            return list[i] 
+      
+    return -1
+
+list=[]
+n=int(input("Enter the size of array:"))
+if n<=1000000:
+    for i in range(n):
+        item=int(input())
+        list.append(item)
+    print(list)
+    
+print("Non repeating element is :",non_repeating(list,n))
diff --git a/Array/17EGICS031_ARRAY_31.py b/Array/17EGICS031_ARRAY_31.py
new file mode 100644
index 0000000..f8d1a96
--- /dev/null
+++ b/Array/17EGICS031_ARRAY_31.py
@@ -0,0 +1,21 @@
+def non_repeating(list,n):
+    for i in range(n): 
+        j = 0
+        while(j < n): 
+            if (i != j and list[i] == list[j]): 
+                break
+            j += 1
+        if (j == n): 
+            return list[i] 
+      
+    return -1
+
+list=[]
+n=int(input("Enter the size of array:"))
+if n<=1000000:
+    for i in range(n):
+        item=int(input())
+        list.append(item)
+    print(list)
+    
+print("Non repeating element is :",non_repeating(list,n))
diff --git a/Array/17EGICS048_ARRAY_2 b/Array/17EGICS048_ARRAY_2.c
similarity index 100%
rename from Array/17EGICS048_ARRAY_2
rename to Array/17EGICS048_ARRAY_2.c
diff --git a/Array/17EGICS048_ARRAY_6.c b/Array/17EGICS048_ARRAY_6.c
new file mode 100644
index 0000000..414911e
--- /dev/null
+++ b/Array/17EGICS048_ARRAY_6.c
@@ -0,0 +1,32 @@
+#include<stdio.h>
+void main()
+{
+	int n,i,t=0,p=0,q;
+	printf("enter size of an array:");
+	scanf("%d",&n);
+	int a[n];
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+		if(a[i]>t)
+		{
+			t=a[i];
+			q=i;
+		}
+	}
+	for(i=0;i<n;i++)
+	{
+	    if(a[i]<t && a[i]>p)
+		{
+		    p=a[i];	
+		}
+		if(a[i]==t)
+		{
+			if(i!=q)
+			{
+				p=a[i];
+			}	
+		}	
+	}
+	printf("%d",t*p);
+}
diff --git a/Array/17EGICS055_ARRAY_2 b/Array/17EGICS055_ARRAY_2.c
similarity index 100%
rename from Array/17EGICS055_ARRAY_2
rename to Array/17EGICS055_ARRAY_2.c
diff --git a/Array/17EGICS057-Array_2.c b/Array/17EGICS057-Array_2.c
new file mode 100644
index 0000000..ac9491b
--- /dev/null
+++ b/Array/17EGICS057-Array_2.c
@@ -0,0 +1,34 @@
+#include<stdio.h>
+void main()
+{
+	int n,z,sum1=0,sum2=0;
+	printf("enter a array size");
+	scanf("%d",&n);
+	if(n%2==0)
+	{
+		int a[50],i,j;
+		printf("enter array elements\n");
+		for(i=0;i<n;i++)
+		{
+			scanf("%d",&a[i]);
+		}	
+		z=n/2;
+		for(i=0;i<z;i++)
+		{
+			sum1=sum1+a[i];
+		}
+		for(j=z;j<n;j++)
+		{
+			sum2=sum2+a[j];
+		}
+	(sum1<sum2)?printf("minimum sum is %d",sum1):printf("minimum sum is %d",sum2);
+		
+	}
+	else
+	{
+		printf("please enter even no. of array size");
+		
+	}
+
+	
+}
diff --git a/Array/17EGICS068_Array2_1.c b/Array/17EGICS068_Array2_1.c
new file mode 100644
index 0000000..22e1117
--- /dev/null
+++ b/Array/17EGICS068_Array2_1.c
@@ -0,0 +1,37 @@
+#include<stdio.h>
+int main()
+{
+	int *a,*c;
+	unsigned long  j,n,i;
+	printf("enter the length of the array required  ");//asking for user input.
+	scanf("%d",&n);
+	a = (int*)malloc(n * sizeof(int));//dynamically allocating array for input
+	c = (int*)malloc(n * sizeof(int));//using counter array to check freq.
+	for(i=0;i<n;i++)//making all the counter vaules 0.
+	{
+		c[i]=0;
+	}
+	for(i=0;i<n;i++)//array intake.
+	{
+		printf("enter the %dth element\n",i+1);
+		scanf("%d",&a[i]);
+	}
+	for(i=0;i<n;i++)//scaning of each element for its frequency.
+	{
+		for(j=0;j<n;j++)
+		{
+	    	if(a[i]==a[j])
+			c[i]=c[i]+1;
+		}
+	}
+	for(i=0;i<n;i++)//loop for checking the freq. as 1
+	{
+		if(c[i]==1)//condition for counter chceking freq. as 1
+		 {
+		  printf("\n(%d)this element has frequency as 1 \n entered at position %d",a[i],i+1);//printing non-repeating elements.
+		 }
+	
+	}
+    
+}
+//9	13	C:\Users\Atc\Desktop\cprog\test.c	[Warning] incompatible implicit declaration of built-in function 'malloc'
diff --git a/Array/17EGICS068_Array2_2.c b/Array/17EGICS068_Array2_2.c
new file mode 100644
index 0000000..34a0d56
--- /dev/null
+++ b/Array/17EGICS068_Array2_2.c
@@ -0,0 +1,28 @@
+#include<stdio.h>
+#include<string.h>
+int main()
+{   
+	unsigned long s,n,front=-1,rear=-1,i,j; 
+	char *a,temp;
+	printf("enter the length of the array required  "); //entering array
+	scanf("%ld",&n);
+	a = (char*)malloc(n * sizeof(char));//dynamically allocating array 
+	fflush(stdin);
+	printf("enter array\n:-");
+    gets(a); //array input
+	printf("enter the no. of shifts required  ");
+	scanf("%ld",&s);//number of sifts required.
+    for(i=0;i<s;i++) //loop for shifts that would be required .
+	{
+	   temp=a[n-1];//storing last char. in string within temp variable.
+	   for(j=n-2;j<-1;j--)//loop for shifting the each char. in string by one block.
+	   {
+	   	   a[j+1]=a[j]; //each char. sfited to block ahead.
+	   }
+	     a[0]=temp;//storing the last char. in temp on to first block.
+    }
+   printf("\nfinal array is \n"); //printing the final string.
+	puts(a);	
+}
+//9	13	C:\Users\Atc\Desktop\cprog\test.c	[Warning] incompatible implicit declaration of built-in function 'malloc'
+//C:\Users\Atc\Desktop\cprog\cc1.exe	[Warning] command line option '-std=c++11' is valid for C++/ObjC++ but not for C
diff --git a/17EGICS068_Array_1.c b/Array/17EGICS068_Array_1.c
similarity index 100%
rename from 17EGICS068_Array_1.c
rename to Array/17EGICS068_Array_1.c
diff --git a/17EGICS068_Array_2.c b/Array/17EGICS068_Array_2.c
similarity index 95%
rename from 17EGICS068_Array_2.c
rename to Array/17EGICS068_Array_2.c
index f592ebc..25cdd5f 100644
--- a/17EGICS068_Array_2.c
+++ b/Array/17EGICS068_Array_2.c
@@ -1,25 +1,25 @@
-#include<stdio.h>
-int main()
-{
-	int *a,n,i,front,mid;
-	float sum1=0,sum2=0;
-	printf("enter the length of the array required \n note:-Take the array to be even blocks\n");
-	scanf("%d",&n);
-	front = 0;
-	mid=n/2;
-	a = (int*)malloc(n * sizeof(int));
-	for(i=0;i<n;i++)
-	{
-		printf("enter the %dth element\n",i+1);
-		scanf("%d",&a[i]);
-	}
-	for(i=front;i<mid;i++)
-	 {
-	 	sum1=sum1+a[i];
-	 }
-	for(i=mid;i<n;i++)
-	 {
-	 	sum2=sum2+a[i];
-	 } 
-	printf("sum of first half of the array is %.2f and sum of second half of the array is %.2f",sum1,sum2);
-}
+#include<stdio.h>
+int main()
+{
+	int *a,n,i,front,mid;
+	float sum1=0,sum2=0;
+	printf("enter the length of the array required \n note:-Take the array to be even blocks\n");
+	scanf("%d",&n);
+	front = 0;
+	mid=n/2;
+	a = (int*)malloc(n * sizeof(int));
+	for(i=0;i<n;i++)
+	{
+		printf("enter the %dth element\n",i+1);
+		scanf("%d",&a[i]);
+	}
+	for(i=front;i<mid;i++)
+	 {
+	 	sum1=sum1+a[i];
+	 }
+	for(i=mid;i<n;i++)
+	 {
+	 	sum2=sum2+a[i];
+	 } 
+	printf("sum of first half of the array is %.2f and sum of second half of the array is %.2f",sum1,sum2);
+}
diff --git a/Array/17EGICS071_Array10.c b/Array/17EGICS071_Array10.c
new file mode 100644
index 0000000..50578c7
--- /dev/null
+++ b/Array/17EGICS071_Array10.c
@@ -0,0 +1,35 @@
+#include<stdio.h>
+#include<conio.h>
+int main()
+{ int n,flag=0,i,t;
+  printf("Enter size of an array");
+  scanf("%d",&n);
+  int a[n];
+  printf("Enter elements of an array");
+  for(i=0;i<n;i++)
+  {
+  	scanf("%d",&a[i]);
+  	
+  }
+	printf("enter the target value");
+	scanf("%d",&t);
+	for(i=0;i<n;i++)
+	{
+		if( a[i]==t )
+		{ flag=1;
+	      printf("%d",i);
+	      break;
+		 }
+	if(flag==0 && (a[i]>t && a[i-1]<t))
+	{  printf("%d",i);
+		break;
+	   
+		
+	}}
+
+	
+	
+	
+	getch();
+	return 0;
+}
diff --git a/17EGICS071_Array3.py b/Array/17EGICS071_Array3.py
similarity index 100%
rename from 17EGICS071_Array3.py
rename to Array/17EGICS071_Array3.py
diff --git a/Array/17EGICS071_Array6.c b/Array/17EGICS071_Array6.c
new file mode 100644
index 0000000..19b47f6
--- /dev/null
+++ b/Array/17EGICS071_Array6.c
@@ -0,0 +1,29 @@
+#include<stdio.h>
+#include<conio.h>
+#include<math.h>
+int main()
+{ int n,i , p=0,j,max=0;
+  printf("Enter size of an Array:");
+  scanf("%d",&n);
+  int a[n];
+	printf("Enter elements of Array:");
+	for(i=0;i<n;i++)
+	  {
+		scanf("%d",&a[i]);
+	  }  
+   if(1<n||n<pow(10,6))
+   {
+     for(i=0;i<n;i++)
+	  {
+		for(j=i+1;j<n;j++)
+		{   p=a[i]*a[j];
+			if(p>max)
+		     {
+		 		max=p;
+		 	  }
+	}}}
+printf("Maximum product: %d",max);
+getch();
+return 0;	
+	
+}
diff --git a/Array/17EGICS071_Array7.c b/Array/17EGICS071_Array7.c
new file mode 100644
index 0000000..700cc35
--- /dev/null
+++ b/Array/17EGICS071_Array7.c
@@ -0,0 +1,28 @@
+#include<stdio.h>
+#include<conio.h>
+int main()
+{	int n,i,j,c=0;
+	printf("enter the size of an array");
+	scanf("%d",&n);
+	int a[n];
+	printf("enter the elements");
+	for(i=0;i<n;i++)
+	{ scanf("%d",&a[i]);}
+	printf("leaders are:");
+		for(i=0;i<n;i++){
+			int c=0;
+			for(j=i+1; j<n;j++)
+			{	if(a[i]<=a[j])
+		    	 {	c++;
+		    	 break;
+				 }
+			}
+			
+			if(c==0 || a[i]==a[n-1])
+			{
+				printf("%d  ",a[i]);
+		}	}
+
+getch();
+return 0;
+}
diff --git a/Array/17EGICS071_Array_2.py b/Array/17EGICS071_Array_1.py
similarity index 100%
rename from Array/17EGICS071_Array_2.py
rename to Array/17EGICS071_Array_1.py
diff --git a/Array/17EGICS071_String.py b/Array/17EGICS071_String.py
new file mode 100644
index 0000000..f0ac83a
--- /dev/null
+++ b/Array/17EGICS071_String.py
@@ -0,0 +1,15 @@
+import math
+str = ""
+size = int(input("Enter the size"))
+str = input('Enter a String: ')
+s= int(input("How many time you want to shift  "))
+print("Before Shifting",str)
+if(len(str) != 0):
+    if(1<size or size<pow(10,6)):
+        for d in range(s):
+            str = str[size-1] + str[:size-1]
+    
+    print("After Shifting",str)
+else:
+    print("string is empty")
+        
diff --git a/Array/17EGICS072_Array_3.c b/Array/17EGICS072_Array_3.c
new file mode 100644
index 0000000..e2581aa
--- /dev/null
+++ b/Array/17EGICS072_Array_3.c
@@ -0,0 +1,27 @@
+#include<stdio.h>
+int main()
+{
+  int i,n,j;
+  printf("enter array size:");
+  scanf("%d",&n);
+  int a[n];
+  for(i=0;i<n;i++)
+  {
+    scanf("%d",&a[i]);
+  }
+  for(i=0;i<n;i++)
+  {
+    for(j=0;j<n;j++)
+    {
+      if(a[i]==a[j] && i!=j)
+      {
+        break;
+      }
+    }
+    if(j==n)
+    {
+      printf("\n Non Repeating element %d",a[i]);
+    }
+   }
+ }  
+   
diff --git a/Array/17EGICS077_Array_3.cpp b/Array/17EGICS077_Array_3.cpp
new file mode 100644
index 0000000..9e2824a
--- /dev/null
+++ b/Array/17EGICS077_Array_3.cpp
@@ -0,0 +1,32 @@
+#include<stdio.h>
+int main()
+{
+	int l,i,j,y,no;
+	printf("LENGHT OF ARRAY: ");
+	scanf("%d",&l);
+	int x[l];
+	printf("ENTER ARRAY ELEMENT :\n");
+	for(i=0;i<l;i++)
+	{
+		scanf("%d",&x[i]);
+	}
+	for(i=0;i<l;i++)
+	{
+		y=0;
+		{	
+			for(j=0;j<l;j++)
+		    {
+		    	if (x[j]==x[i])
+			    {
+			    	y = y+1;
+			    }
+		    }
+		    if(y==1)
+		    {
+		    	
+		    	no=x[i];
+		    	printf("\n%d",no);
+			}
+	    }
+	}
+}
diff --git a/Array/17EGICS077_Array_4.cpp b/Array/17EGICS077_Array_4.cpp
new file mode 100644
index 0000000..12f3565
--- /dev/null
+++ b/Array/17EGICS077_Array_4.cpp
@@ -0,0 +1,26 @@
+#include<stdio.h>
+int main()
+{
+	
+	int l,i,j,r;
+	printf("LENGHT OF ARRAY: ");
+	scanf("%d",&l);
+	char x[l],temp;
+	printf("ENTER ARRAY ELEMENT :\n");
+	scanf("%s",&x);
+	printf("Rotation : ");
+	scanf("%d",&r);
+	for(j=0;j<r;j++)
+	{
+		temp=x[l-1];
+		for(i=l-1;i>0;i--)
+		{
+			x[i]=x[i-1];
+		}
+		x[0]=temp;
+	}
+
+			printf("string after rotation :%s",x);	
+	
+	
+}
diff --git a/Array/17EGICS083_ARRAY_10.c b/Array/17EGICS083_ARRAY_10.c
new file mode 100644
index 0000000..2076e35
--- /dev/null
+++ b/Array/17EGICS083_ARRAY_10.c
@@ -0,0 +1,26 @@
+#include<stdio.h>
+int main()
+{
+	int n,i,t;
+	printf("Enter size of array");
+	scanf("%d",&n);
+	int a[n];
+	printf("Enter array elements");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+	printf("Enter target value");
+	scanf("%d",&t);
+	for(i=0;i<n;i++)
+	{
+		if(t==a[i])
+		{
+			printf("%d ",i);
+		}
+		else if(t>a[i] && t<a[i+1])
+		{
+			printf("%d ",(i+1));
+		}
+	}
+}
diff --git a/Array/17EGICS083_ARRAY_11.c b/Array/17EGICS083_ARRAY_11.c
new file mode 100644
index 0000000..2d3b726
--- /dev/null
+++ b/Array/17EGICS083_ARRAY_11.c
@@ -0,0 +1,27 @@
+#include<stdio.h>
+int main()
+{
+	int check=0,i,n,j,sum;
+	printf("Enter size of the array");
+	scanf("%d",&n);
+	int a[n];
+	printf("Enter array elements");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+	for(i=0;i<n;i++)
+	{
+		sum=0;
+		sum=a[i];
+		for(j=i+1;j<n;j++)
+		{
+			sum=sum+a[j];
+			if(check<sum)
+			{
+				check=sum;
+			}
+		}
+	}
+	printf("%d",check);
+}
diff --git a/Array/17EGICS083_ARRAY_7.c b/Array/17EGICS083_ARRAY_7.c
new file mode 100644
index 0000000..7baafa0
--- /dev/null
+++ b/Array/17EGICS083_ARRAY_7.c
@@ -0,0 +1,34 @@
+#include<stdio.h>
+int main()
+{
+	int i,j,no,no1,count,c,n;
+	printf("Enter the size:");
+	scanf("%d",&n);
+	int a[n];
+	printf("Enter array elments");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+	for(i=0;i<n;i++)
+	{
+		count=0;
+		for(j=i+1;j<n;j++)
+			{
+				if(a[i]>a[j])
+					{
+						count++;
+					}
+							
+			}
+			
+	c = (n-1)-i;
+	if(c == count)
+		{
+			no = a[i];
+			printf("%d ",no);
+		}
+		
+	}
+	
+}
diff --git a/Array/17EGICS083_Array_3.cpp b/Array/17EGICS083_Array_3.cpp
new file mode 100644
index 0000000..8d71f85
--- /dev/null
+++ b/Array/17EGICS083_Array_3.cpp
@@ -0,0 +1,32 @@
+#include<stdio.h>
+int main()
+{
+	int n,no,i,j,count;
+	printf("Enter size of the array");
+	scanf("%d",&n);
+	int a[n];
+	printf("Enter array elements");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+	for(i=0;i<n;i++)
+	{
+		count=0;
+		for(j=i+1;j<n;j++)
+		{
+			
+			if(a[j]==a[i])
+			{
+				count++;
+				
+			}
+		}
+		if(count==0)
+		{
+			no=a[i];
+			break;
+		}
+	}
+	printf("%d",no);
+}
diff --git a/Array/17EGICS083_Array_4.cpp b/Array/17EGICS083_Array_4.cpp
new file mode 100644
index 0000000..5f21022
--- /dev/null
+++ b/Array/17EGICS083_Array_4.cpp
@@ -0,0 +1,28 @@
+#include<stdio.h>
+int main()
+{
+	int n,i,j,rot_fac,temp;
+	printf("Enter size of string");
+	scanf("%d",&n);
+	char str[n];
+	printf("Enter string");
+	scanf("%s",str);
+	printf("Enter rotation factor");
+	scanf("%d",&rot_fac);
+	for(j=1;j<=rot_fac;j++)
+	{
+		temp=str[n-1];
+		for(i=n-1;i>=0;i--)
+		{
+			if(i>0)
+			{
+				str[i]=str[i-1];
+			}
+			else
+			{
+				str[i]=temp;
+			}	
+		}
+	}
+	printf("%s",str);	
+}
diff --git a/Array/17EGICS090_ARRARY_1.py b/Array/17EGICS090_ARRARY_1.py
new file mode 100644
index 0000000..5e99a17
--- /dev/null
+++ b/Array/17EGICS090_ARRARY_1.py
@@ -0,0 +1,16 @@
+#Task 1
+n = int(input())
+array = []
+feq = {}
+for i in range(0,n):
+	var = int(input())
+	array.append(var)
+	if var not in feq.keys():
+		feq[var] = 1
+	else:
+		feq[var] += 1
+maxfeq = max(feq.values())
+key_list = list(feq.keys())
+val_list = list(feq.values())
+print()
+print(key_list[val_list.index(maxfeq)],maxfeq)
\ No newline at end of file
diff --git a/Array/17EGICS090_ARRARY_2.py b/Array/17EGICS090_ARRARY_2.py
new file mode 100644
index 0000000..41ae5e2
--- /dev/null
+++ b/Array/17EGICS090_ARRARY_2.py
@@ -0,0 +1,13 @@
+#Task 2
+n = int(input())
+array1 = []
+array2 = []
+for i in range(0,n):
+	if i<(n//2):
+		array1.append(int(input()))
+	else:
+		array2.append(int(input()))
+
+arr1sum = sum(array1)
+arr2sum = sum(array2)
+print("\n"+str(min(arr1sum,arr2sum)))
\ No newline at end of file
diff --git a/Array/17EGICS090_ARRARY_3.py b/Array/17EGICS090_ARRARY_3.py
new file mode 100644
index 0000000..e3ef827
--- /dev/null
+++ b/Array/17EGICS090_ARRARY_3.py
@@ -0,0 +1,15 @@
+#Task 3
+n = int(input())
+array = []
+feq = {}
+for i in range(0,n):
+	var = int(input())
+	array.append(var)
+	if var not in feq.keys():
+		feq[var] = 1
+	else:
+		feq[var] += 1
+key_list = list(feq.keys())
+val_list = list(feq.values())
+print()
+print(key_list[val_list.index(1)])
\ No newline at end of file
diff --git a/Array/17EGICS090_ARRARY_4.py b/Array/17EGICS090_ARRARY_4.py
new file mode 100644
index 0000000..c5931b0
--- /dev/null
+++ b/Array/17EGICS090_ARRARY_4.py
@@ -0,0 +1,9 @@
+#Task 4
+n = int(input())
+data = list(input())
+s = int(input())
+new_arr = []
+for i in range(0,n):
+	new_arr.insert((i+s)%(n),data[i])
+print()
+print("".join(new_arr))
\ No newline at end of file
diff --git a/Array/17EGICS090_ARRARY_5.py b/Array/17EGICS090_ARRARY_5.py
new file mode 100644
index 0000000..01c6a30
--- /dev/null
+++ b/Array/17EGICS090_ARRARY_5.py
@@ -0,0 +1,32 @@
+#Task 5
+n = int(input())
+array = []
+for i in range(0,n):
+	array.append(int(input()))
+i=1
+temp = []
+subarray = []
+temp.append(array[0])
+while i!=n:
+	if array[i]>temp[-1]:
+		temp.append(array[i])
+		i+=1
+	else:
+		subarray.append(temp)
+		temp = [array[i]]
+		i+=1
+else:
+	if array[i-1]>temp[-1]:
+		temp.append(array[i])
+	subarray.append(temp)
+
+maxsum = min(array)
+maxlength = 0
+for sa in subarray:
+	if len(sa)>=maxlength:
+		temp = sum(sa)
+		if temp>maxsum:
+			maxsum = temp
+			maxlength = len(sa)
+print()
+print(maxsum)
\ No newline at end of file
diff --git a/Array/17EGICS090_ARRARY_6.py b/Array/17EGICS090_ARRARY_6.py
new file mode 100644
index 0000000..c8672c8
--- /dev/null
+++ b/Array/17EGICS090_ARRARY_6.py
@@ -0,0 +1,10 @@
+#Task 6
+n = int(input())
+array = []
+for i in range(0,n):
+	array.append(int(input()))
+maxelement = max(array)
+array.pop(array.index(maxelement))
+nextmaxelement = max(array)
+print()
+print(maxelement*nextmaxelement)
\ No newline at end of file
diff --git a/Array/17EGICS090_ARRARY_7.py b/Array/17EGICS090_ARRARY_7.py
new file mode 100644
index 0000000..73e42a6
--- /dev/null
+++ b/Array/17EGICS090_ARRARY_7.py
@@ -0,0 +1,11 @@
+#Task 7
+array = list(map(int,input().split()))
+N = len(array)
+for i in range(0,N):
+	flag = 0
+	for j in range(i+1,N):
+		if array[j]>=array[i]:
+			flag=1
+			break
+	if flag==0:
+		print(array[i],end=" ")
diff --git a/Array/17EGICS090_ARRARY_8.py b/Array/17EGICS090_ARRARY_8.py
new file mode 100644
index 0000000..1aadbe7
--- /dev/null
+++ b/Array/17EGICS090_ARRARY_8.py
@@ -0,0 +1,21 @@
+#Task 8
+arr = list(map(int,input().split()))
+N = len(arr)
+def combination(arr, num_element, last=False):
+    if num_element == 0:
+        yield []
+    if 0 < num_element <= len(arr):
+        first, *rest = arr
+        if not last:
+            for c in combination(rest, num_element-1, True):
+                yield [first] + c
+        for c in combination(rest, num_element, False):
+            yield c
+
+maximum = arr[0]
+for i in range(1,N):
+	for val in combination(arr,i):
+		if sum(val)>maximum:
+			maximum = sum(val)
+
+print(maximum)
\ No newline at end of file
diff --git a/Array/17EGICS090_ARRARY_9.py b/Array/17EGICS090_ARRARY_9.py
new file mode 100644
index 0000000..203b5b4
--- /dev/null
+++ b/Array/17EGICS090_ARRARY_9.py
@@ -0,0 +1,13 @@
+#Task 9
+#Requires python 3.8 and up
+from math import prod
+arr = list(map(int,input().split()))
+N = len(arr)
+product = []
+
+for i in range(0,N):
+	temp = arr[:i]+arr[i+1:]
+	mul = prod(temp)
+	product.append(mul)
+	
+print(product)
\ No newline at end of file
diff --git a/Array/17EGICS090_ARRAY_10.py b/Array/17EGICS090_ARRAY_10.py
new file mode 100644
index 0000000..078ce05
--- /dev/null
+++ b/Array/17EGICS090_ARRAY_10.py
@@ -0,0 +1,14 @@
+#Task 10
+n=int(input())
+t=int(input())
+array = list(map(int, input().split()))
+for i in range(0,n):
+	if array[i]==t:
+		print(i)
+		break
+	elif array[i]>t:
+		print(i)
+		break
+	elif i==n-1:
+	    print(n)
+	    break
diff --git a/Array/17EGICS090_ARRAY_11.py b/Array/17EGICS090_ARRAY_11.py
new file mode 100644
index 0000000..8ddfa49
--- /dev/null
+++ b/Array/17EGICS090_ARRAY_11.py
@@ -0,0 +1,13 @@
+#Task 11
+n=int(input())
+array = list(map(int, input().split()))
+maximum = min(array)
+
+for i in array:
+	total = i
+	for j in array[array.index(i)+1:]:
+		total+=j
+		if total>maximum:
+			maximum=total
+
+print(maximum)
\ No newline at end of file
diff --git a/Array/17EGICS092_ARRAY_3.py b/Array/17EGICS092_ARRAY_3.py
new file mode 100644
index 0000000..9b98533
--- /dev/null
+++ b/Array/17EGICS092_ARRAY_3.py
@@ -0,0 +1,10 @@
+n = int(input())
+test=[]
+for i in range(0,n):
+    test.append(int(input()))
+dict={}
+for i in test:
+    dict[i] = test.count(i)
+for i in dict:
+	if dict[i]==1:
+		print(i)
diff --git a/Array/17EGICS092_ARRAY_4.py b/Array/17EGICS092_ARRAY_4.py
new file mode 100644
index 0000000..bc57a85
--- /dev/null
+++ b/Array/17EGICS092_ARRAY_4.py
@@ -0,0 +1,10 @@
+n = int(input())
+inputarray = list(input())
+s = int(input())
+newarray = []
+i = 0
+while i<n:
+	index = (i+s)%n
+	newarray.insert(index,inputarray[i])
+	i+=1
+print("".join(newarray))
\ No newline at end of file
diff --git a/Array/17EGICS092_ARRAY_5.py b/Array/17EGICS092_ARRAY_5.py
new file mode 100644
index 0000000..e3b0e60
--- /dev/null
+++ b/Array/17EGICS092_ARRAY_5.py
@@ -0,0 +1,30 @@
+n=int(input())
+a=[]
+dict={}
+sum,c=0,0
+for i in range(n):
+	a.append(int(input()))
+for i in range(0,n):
+	if i<(n-1):
+		if a[i]<a[i+1]:
+			sum=sum+a[i]
+			c+=1
+		else:
+			sum=sum+a[i]
+			c+=1
+			dict[sum]=c
+			sum,c=0,0
+	else:
+		sum=sum+a[i]
+		c+=1
+		dict[sum]=c
+
+maxlength = 0
+maxsum = min(dict)
+for x in dict:
+	if dict[x]>=maxlength:
+		maxlength = dict[x]
+		if x>maxsum:
+			maxsum = x
+
+print("\n"+str(maxsum))
diff --git a/Array/17EGICS092_ARRAY_6.py b/Array/17EGICS092_ARRAY_6.py
new file mode 100644
index 0000000..753df4d
--- /dev/null
+++ b/Array/17EGICS092_ARRAY_6.py
@@ -0,0 +1,8 @@
+n=int(input())
+a=[]
+for i in range(0,n):
+	a.append(int(input()))
+m=max(a)
+a.remove(m)
+n=max(a)
+print(m*n)
diff --git a/Array/17EGICS092_ARRAY_7.py b/Array/17EGICS092_ARRAY_7.py
new file mode 100644
index 0000000..8e57809
--- /dev/null
+++ b/Array/17EGICS092_ARRAY_7.py
@@ -0,0 +1,18 @@
+n = int(input())
+a = []
+c = 0
+for i in range(n):
+	a.append(int(input()))
+for i in range(0,n):
+	for j in range(i+1,n):
+		if a[i]>a[j]:
+			c+=1
+		else:
+			c=0
+			break
+
+	if c!=0:
+		print(a[i])
+		c=0
+
+print(a[n-1])
\ No newline at end of file
diff --git a/Array/17EGICS092_ARRAY_8.py b/Array/17EGICS092_ARRAY_8.py
new file mode 100644
index 0000000..3453c1a
--- /dev/null
+++ b/Array/17EGICS092_ARRAY_8.py
@@ -0,0 +1,14 @@
+n = int(input())
+array = []
+for i in range(0,n):
+    array.append(int(input()))
+addition1 = array[0]
+addition2 = 0
+for i in range(1, len(array)):
+    temp = max(addition1, addition2)
+
+    addition1 = array[i] + addition2
+
+    addition2 = temp
+    
+print(max(addition1, addition2))
\ No newline at end of file
diff --git a/Array/17EGICS092_ARRAY_9.py b/Array/17EGICS092_ARRAY_9.py
new file mode 100644
index 0000000..29977f2
--- /dev/null
+++ b/Array/17EGICS092_ARRAY_9.py
@@ -0,0 +1,14 @@
+import numpy
+n=int(input())
+a=[]
+b=[]
+c=[]
+for i in range(0,n):
+	a.append(int(input()))
+	b.append(a[i])
+for i in range(0,n):
+	a.remove(a[0])
+	res=numpy.product(a)
+	c.append(res)
+	a.append(b[i])
+print(c)
\ No newline at end of file
diff --git a/Array/17EGICS110_Array_3.py b/Array/17EGICS110_Array_3.py
new file mode 100644
index 0000000..9b98533
--- /dev/null
+++ b/Array/17EGICS110_Array_3.py
@@ -0,0 +1,10 @@
+n = int(input())
+test=[]
+for i in range(0,n):
+    test.append(int(input()))
+dict={}
+for i in test:
+    dict[i] = test.count(i)
+for i in dict:
+	if dict[i]==1:
+		print(i)
diff --git a/Array/17EGICS110_Array_4.py b/Array/17EGICS110_Array_4.py
new file mode 100644
index 0000000..785f661
--- /dev/null
+++ b/Array/17EGICS110_Array_4.py
@@ -0,0 +1,12 @@
+n=int(input())
+test=[]
+for i in range(0,n):
+	test.append(input())
+s=int(input())
+n_test=[]
+for i in range(n):
+	if (i+s)<n:
+		n_test.insert(i+s,test[i])
+	else:
+		n_test.insert((s+i)%n,test[i])
+print("".join(n_test))
diff --git a/Array/17EGICS300_ARRAY_1 b/Array/17EGICS300_ARRAY_1.c
similarity index 100%
rename from Array/17EGICS300_ARRAY_1
rename to Array/17EGICS300_ARRAY_1.c
diff --git a/Array/17EGICS300_ARRAY_2.c b/Array/17EGICS300_ARRAY_2.c
new file mode 100644
index 0000000..7d94674
--- /dev/null
+++ b/Array/17EGICS300_ARRAY_2.c
@@ -0,0 +1,22 @@
+#include<stdio.h>
+#include <stdlib.h> 
+int main()
+{
+	int*arr;
+	int n,i,j,sum1=0,sum2=0;
+	printf("Enter the size of array");
+	scanf("%d",&n);
+	if(n%2==0)
+	{
+		arr = (int*)malloc(n*sizeof(int));
+		for(i=0;i<n;i++)
+		scanf("%d",&arr[i]);
+		for(i=0,j=n-1;i<j;i++,j--)
+		{
+			sum1=sum1+arr[i];	
+			sum2=sum2+arr[j];	
+		}
+		sum1<=sum2?printf("%d",sum1):printf("%d",sum2);
+	}
+	return 0;
+}
diff --git a/Array/17EGICS300_Array_3.c b/Array/17EGICS300_Array_3.c
new file mode 100644
index 0000000..1dd2590
--- /dev/null
+++ b/Array/17EGICS300_Array_3.c
@@ -0,0 +1,30 @@
+#include<stdio.h>
+#include<stdlib.h>
+int main()
+{
+int *arr;
+int n,i,j,count;
+
+
+printf("Enter the size of array\n");
+scanf("%d",&n);
+
+arr=(int*)malloc(n*sizeof(int));
+
+for(i=0;i<n;i++)
+scanf("%d",&arr[i]);
+
+printf("Non Repeating elements is \n");
+for(i=0;i<n;i++)
+{
+	count=0;
+	for(j=0;j<n;j++)
+	{
+		if(arr[i]==arr[j])
+		count++;
+	}
+	if(count<2)
+	printf("%d\n",arr[i]);
+}
+return 0;
+}
diff --git a/Array/17EGICS300_Array_4.c b/Array/17EGICS300_Array_4.c
new file mode 100644
index 0000000..50081d3
--- /dev/null
+++ b/Array/17EGICS300_Array_4.c
@@ -0,0 +1,26 @@
+#include<stdio.h>
+#include<stdlib.h>
+int main()
+{
+
+int n,s,i,j,temp;
+printf("Enter the size of array\n");
+scanf("%d",&n);
+char arr[n];
+scanf("%s",&arr);
+printf("Enterno of place to shift\n");
+scanf("%d",&s);
+for(i=0;i<s;i++)
+{
+	temp=arr[n-1];
+	for(j=n-1;j>0;j--)
+	{
+		arr[j]=arr[j-1];
+	}
+	arr[0]=temp;
+}
+printf("After shifting character array is \n");
+printf("%s",arr);
+
+return 0 ;
+}
diff --git a/Array/17EGICS300_Array_6.c b/Array/17EGICS300_Array_6.c
new file mode 100644
index 0000000..4a533b8
--- /dev/null
+++ b/Array/17EGICS300_Array_6.c
@@ -0,0 +1,30 @@
+#include<stdio.h>
+#include<conio.h>
+int main()
+{
+int *arr;
+int n,i,j,max=0;
+printf("Enter the even  size of array");
+scanf("%d",&n);
+if(n%2==0)
+{
+arr=(int*)malloc(n*sizeof(int));
+for(i=0;i<n;i++)
+scanf("%d",&arr[i]);
+printf("Max product is \n");
+for(i=0;i<n;i++)
+{
+  for(j=i+1;j<n;j++)
+  {
+     if(arr[i]*arr[j]>=max)
+     max=arr[i]*arr[j];
+  }
+}
+printf("%d\n",max);
+}
+else{
+printf("Enter even size ");
+}
+getch();
+return 0;
+}
diff --git a/Array/17EGICS301-DAY3-Array6.c b/Array/17EGICS301-DAY3-Array6.c
new file mode 100644
index 0000000..91aceaa
--- /dev/null
+++ b/Array/17EGICS301-DAY3-Array6.c
@@ -0,0 +1,26 @@
+#include<stdio.h>
+int main()
+{
+	int n,i,j,max=0;
+	printf("enter no of elements");
+	scanf("%d",&n);
+	int a[n];
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	 } 
+	 for(i=0;i<n-1;i++)
+	 {
+	 	
+	 		for(j=i+1;j<n;j++)
+	 		{
+			 
+	 		if(max<a[i]*a[j])
+	 		{
+	 			max=a[i]*a[j];
+			 }
+	}
+	 }
+
+printf("%d",max);
+}
diff --git a/Array/17egics031_array_2.py b/Array/17egics031_array_2.py
new file mode 100644
index 0000000..8d843ff
--- /dev/null
+++ b/Array/17egics031_array_2.py
@@ -0,0 +1,23 @@
+def minSum(arr,s):
+    s=int(s/2)
+    first=arr[:s]
+    second=arr[s:]
+    sum1=sum(first)
+    sum2=sum(second)
+    return min(sum1,sum2)
+
+size=int(input(("Enter the size of array: ")))
+s=size
+arr=[]
+if (s<=1000000 and s%2==0):
+    for size in range(s):
+        num=int(input())
+        arr.append(num)
+    
+print("MINIMUM SUM: ",minSum(arr,s))
+
+        
+
+
+    
+
diff --git a/Array/17egics076_ARRAY_1.py b/Array/17egics076_ARRAY_1.py
new file mode 100644
index 0000000..c21af49
--- /dev/null
+++ b/Array/17egics076_ARRAY_1.py
@@ -0,0 +1,31 @@
+#!/usr/bin/env python
+# coding: utf-8
+
+# In[5]:
+
+
+n = int(input("enter no of array elemnets: "))
+arr = []
+print("enter elements")
+arr = list(map(int,input().split()))
+def max_occu(arr):
+    maxele,first = 0,arr[0]
+    for item in arr:
+        if arr.count(item)>maxele:
+            first = item
+        maxele = max(maxele,arr.count(item))
+    return(first)
+#print("highest occured number",max_occu(arr))
+
+from collections import Counter
+freq = (Counter(arr))
+for key,value in freq.items():
+    print(max_occu(arr),"occured",value,"times")
+    
+
+
+# In[ ]:
+
+
+
+
diff --git a/Array/17egics076_Array_2.py b/Array/17egics076_Array_2.py
new file mode 100644
index 0000000..f6e869a
--- /dev/null
+++ b/Array/17egics076_Array_2.py
@@ -0,0 +1,55 @@
+#!/usr/bin/env python
+# coding: utf-8
+
+# In[ ]:
+
+
+
+
+
+# In[ ]:
+
+
+
+
+
+# In[ ]:
+
+
+n = int(input("enter no of array elemnets: "))
+arr = []
+print("enter elements")
+
+# for i in range (n):
+#     num = int(input())
+#     arr.append(num)
+
+#arr = [int(i) for i in input().split(" ")]
+
+arr = list(map(int,input().split()))
+
+arr1 = arr[ :len(arr)//2]
+arr2 = arr[len(arr)//2: ]
+
+sum_arr1=0
+for i in arr1:
+    sum_arr1 += i
+#else:
+#    print(sum_arr1)
+sum_arr2 = 0
+for i in arr2:
+    sum_arr2 += i
+#else:
+#    print(sum_arr2)
+
+if sum_arr1 > sum_arr2:
+    print ("Minimum sum is in second half: ",sum_arr2)
+else:
+    print("Minimum sum is in first half: ",sum_arr1)
+
+
+# In[ ]:
+
+
+
+
diff --git a/17egics079_Array_1.py b/Array/17egics079_Array_1.py
similarity index 100%
rename from 17egics079_Array_1.py
rename to Array/17egics079_Array_1.py
diff --git a/Array/17egics079_Array_2.py b/Array/17egics079_Array_2.py
new file mode 100644
index 0000000..b6df109
--- /dev/null
+++ b/Array/17egics079_Array_2.py
@@ -0,0 +1,13 @@
+arr = [9,18,7,8,1,9]
+fpart = arr[0:int(len(arr)/2)]
+spart = arr[int(len(arr)/2):]
+fsum, ssum = 0,0
+
+for i in range(0, len(fpart)):    
+   fsum = fsum + fpart[i];    
+for j in range(0, len(spart)):
+  ssum = ssum + spart[i];    
+
+resList = [fsum,ssum]
+print("Sum of both array list Ex.[sumOfArr1,sumOfArr2] :",resList)
+print("Minimum value in list :",min(resList))
diff --git a/Array/17egics085_Array_3.c b/Array/17egics085_Array_3.c
new file mode 100644
index 0000000..107c1bf
--- /dev/null
+++ b/Array/17egics085_Array_3.c
@@ -0,0 +1,33 @@
+#include<stdio.h>
+
+void main(){
+	
+	int i,j,n,temp;
+	int *arr;
+	
+	scanf("%d",&n);
+	
+	arr = (int*)malloc(n*sizeof(int));
+	
+	for(i=0;i<n;i++){
+		scanf("%1d",&arr[i]);
+	}
+	
+	temp = arr[0];
+	for(i=1;i<n;i++){
+		temp = temp^arr[i];
+	}
+	printf("%d",temp);
+	
+	
+}
+
+
+
+
+
+
+
+
+
+
diff --git a/Array/17egics085_Array_4.c b/Array/17egics085_Array_4.c
new file mode 100644
index 0000000..f1092cb
--- /dev/null
+++ b/Array/17egics085_Array_4.c
@@ -0,0 +1,28 @@
+#include <stdio.h>    
+     
+int main()    
+{    
+	char arr[100];
+	int n,shift;
+	int i,j,last;
+	
+	scanf("%d",&n);
+	
+	scanf("%s",&arr);
+    
+	scanf("%d",&shift);           
+        
+    for( i = 0; i < shift; i++){      
+	   
+        last = arr[n-1];    
+        
+        for(j = n-1; j > 0; j--){    
+               
+            arr[j] = arr[j-1];    
+        }        
+        arr[0] = last;    
+    }    
+        
+    puts(arr);   
+    return 0;    
+}    
diff --git a/Array/17egics085_Array_6.c b/Array/17egics085_Array_6.c
new file mode 100644
index 0000000..49182f4
--- /dev/null
+++ b/Array/17egics085_Array_6.c
@@ -0,0 +1,24 @@
+#include<stdio.h>
+
+void main(){
+	
+	int arr[100];
+	int i,j,n,temp;
+	
+	scanf("%d",&n);
+	
+	for(i=0;i<n;i++){
+		scanf("%d",&arr[i]);
+	}
+	
+	temp = arr[0]*arr[1];
+	
+	for(i=0;i<n;i++){
+		for(j=i+1;j<n;j++){
+			if(arr[i]*arr[j] > temp){
+				temp = arr[i]*arr[j];
+			}
+		}
+	}
+	printf("%d",temp);
+}
diff --git a/17egics124_array2ques1.cpp b/Array/17egics124_array2ques1.cpp
similarity index 100%
rename from 17egics124_array2ques1.cpp
rename to Array/17egics124_array2ques1.cpp
diff --git a/Array/17egics124_question6.cpp b/Array/17egics124_question6.cpp
new file mode 100644
index 0000000..452fc4b
--- /dev/null
+++ b/Array/17egics124_question6.cpp
@@ -0,0 +1,26 @@
+#include<stdio.h>
+void main()
+{
+	int i,j,a,b,n;
+	printf("enter size of array :");
+	scanf("%d",&n);
+	int x[n];
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&x[i]);
+	}
+	a=x[0];
+	b=x[1];
+	for(i=0;i<n;i++)
+	{
+		for(j=i+1;j<n;j++)
+		{
+			if(x[i]*x[j]>a*b)
+			{
+				a=x[i];
+				b=x[j];
+			}
+		}
+	}
+	printf("maximum product is %d",(a*b));
+}
diff --git a/Array/17egics124_task4.cpp b/Array/17egics124_task4.cpp
new file mode 100644
index 0000000..45cc918
--- /dev/null
+++ b/Array/17egics124_task4.cpp
@@ -0,0 +1,27 @@
+#include<stdio.h>
+void main()
+{
+	int i,n,j,s;
+	printf("enter size of array :");
+	scanf("%d",&n);
+	printf("enter no. of shiftings :");
+	scanf("%d",&s);
+	char a[n],temp;
+	for(i=0;i<n;i++)
+	{
+		scanf("%s",&a[i]);
+	}
+	for(j=1;j<=s;j++)
+	{
+		temp=a[n-1];
+		for(i=n-2;i>=0;i--)
+	    {
+		    a[i+1]=a[i];
+	    }
+	    a[0]=temp;
+	}
+	for(i=0;i<n;i++)
+	{
+		printf("%c",a[i]);
+	}
+}
diff --git a/Array/Solution_Array_10.cpp b/Array/Solution_Array_10.cpp
new file mode 100644
index 0000000..ce19230
--- /dev/null
+++ b/Array/Solution_Array_10.cpp
@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int n,t;
+    cin>>n>>t;
+    vector<int> nums(n);
+    for(int i=0;i<n;i++)
+    	cin>>nums[i];
+    for(int i=0;i<n;i++)
+    {
+	    if(t<=nums[i])
+    	{
+    		cout<<i;
+    		exit(0);
+		}
+    }
+	cout<<n;
+}
diff --git a/Array/Solution_Array_11.cpp b/Array/Solution_Array_11.cpp
new file mode 100644
index 0000000..a868356
--- /dev/null
+++ b/Array/Solution_Array_11.cpp
@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+	int n,sum=0,max;
+	cin>>n;
+	vector<int> nums(n);
+	for(int i=0;i<n;i++)
+		cin>>nums[i];
+	max=nums[0];
+	for(int i=0;i<n;i++)
+    {
+        sum = sum + nums[i];
+        if(sum>max)
+            max = sum;  
+        if(sum<0)
+            sum=0;      
+    }
+	cout<<max;	
+}
diff --git a/Array/Solution_Array_3.cpp b/Array/Solution_Array_3.cpp
new file mode 100644
index 0000000..fc9ad52
--- /dev/null
+++ b/Array/Solution_Array_3.cpp
@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+	int n,count;
+	cin>>n;
+	vector<int> v(n);
+	for(int i=0;i<n;i++)
+		cin>>v[i];
+	for(int i=0;i<n;i++)
+	{
+		count=0;
+		for(int j=i;j<n;j++)
+		{
+			if(v[i]==v[j])
+			{
+				count++;
+			}
+		}
+		if(count==1)
+		{
+			cout<<v[i];
+			break;
+		}
+	}	
+}
diff --git a/Array/Solution_Array_3.py b/Array/Solution_Array_3.py
new file mode 100644
index 0000000..5018251
--- /dev/null
+++ b/Array/Solution_Array_3.py
@@ -0,0 +1,14 @@
+def UniqueElemet(arr):
+    for i in arr:
+        if arr.count(i)==1:
+            return i
+    return "No unique element present"        
+
+n=int(input())
+arr=[int(i) for i in input().split()]
+print(UniqueElemet(arr))
+
+
+#Time Complexity->O(N^2) we can reduce time complexity using some of Data Structures which we will discuss in the upcoming week.
+
+    
\ No newline at end of file
diff --git a/Array/Solution_Array_4.cpp b/Array/Solution_Array_4.cpp
new file mode 100644
index 0000000..7e08bcc
--- /dev/null
+++ b/Array/Solution_Array_4.cpp
@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+	int size;
+	cin>>size;
+	char arr[size];
+	char answer[size];
+	cin>>arr;
+	int s;
+	cin>>s;
+	s=s%size;
+	for(int i=0;i<size;i++)
+	{
+		answer[s]=arr[i];
+		s++;
+		if(s==size)
+			s=0;
+	}
+	cout<<answer;
+}
diff --git a/Array/Solution_Array_4.py b/Array/Solution_Array_4.py
new file mode 100644
index 0000000..d3149b7
--- /dev/null
+++ b/Array/Solution_Array_4.py
@@ -0,0 +1,11 @@
+def RightShift(s,shift):
+    return s[len(s)-int(shift%len(s)):]+s[:len(s)-int(shift%len(s))]
+
+n=int(input())
+String=input()
+ShiftPosition=int(input())
+print(RightShift(String,ShiftPosition))
+
+#Time Complexity :- O(N)
+
+    
\ No newline at end of file
diff --git a/Array/Solution_Array_5.cpp b/Array/Solution_Array_5.cpp
new file mode 100644
index 0000000..7653e74
--- /dev/null
+++ b/Array/Solution_Array_5.cpp
@@ -0,0 +1,43 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+	long long int maxSum=0,maxLength=0,currentLength=0,currentSum=0;
+	int n;
+	cin>>n;
+	vector<long long int> v(n);
+	for(int i=0;i<n;i++)
+	{
+		cin>>v[i];
+	}
+	maxSum=currentSum=v[0];
+	maxLength=currentLength=1;
+	for(int i=1;i<n;i++)
+	{
+		if(v[i]>v[i-1])
+		{
+			currentLength++;
+			currentSum = currentSum + v[i];
+			if(currentLength==maxLength)
+			{
+				if(currentSum>maxSum)
+				{
+					maxSum=currentSum;
+				}
+			}
+			else if(currentLength>maxLength)
+			{
+				maxLength=currentLength;
+				maxSum=currentSum;
+			}
+		}
+		else
+		{
+			currentSum =v[i];
+			currentLength=1;
+		}
+	}
+	cout<<maxSum;
+    return 0;
+}
diff --git a/Array/Solution_Array_5.py b/Array/Solution_Array_5.py
new file mode 100644
index 0000000..f68a568
--- /dev/null
+++ b/Array/Solution_Array_5.py
@@ -0,0 +1,29 @@
+def LongestContinouesSubarraySum(arr):
+    n=len(arr)
+    MaximumSum,MaxSize=arr[0],1
+    count,summ=1,arr[0]
+    for i in range(1,n):
+        if arr[i]>arr[i-1]:
+            count+=1
+            summ+=arr[i]
+        else:
+            if count>MaxSize:
+                MaxSize=count
+                MaximumSum=summ
+            elif count==MaxSize and summ>MaximumSum:
+                MaximumSum=summ                            
+            count,summ=1,arr[i]    
+
+    if count>MaxSize:
+        return summ
+    elif count==MaxSize:
+        return max(MaximumSum,summ) 
+    else: 
+            return MaximumSum              
+
+n=int(input())
+arr=[int(i) for i in input().split()]
+print(LongestContinouesSubarraySum(arr))    
+
+
+#Time Complexity:- O(N)
\ No newline at end of file
diff --git a/Array/Solution_Array_6.cpp b/Array/Solution_Array_6.cpp
new file mode 100644
index 0000000..5fc973e
--- /dev/null
+++ b/Array/Solution_Array_6.cpp
@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+	int n;
+	cin>>n;
+	vector<long long int> v(n);
+	for(int i=0;i<n;i++)
+	{
+		cin>>v[i];
+	}
+	long long int max1;
+	long long int max2;
+	max1=*max_element(v.begin(),v.end());//Finding maximum element in vector
+	for(int i=0;i<n;i++)
+	{
+		if(v[i]==max1)
+		{
+			v.erase(v.begin()+i);//Removing maximum element from the vector
+			break;
+		}
+	}
+	max2=*max_element(v.begin(),v.end());
+	cout<<max1*max2;
+    return 0;
+}
diff --git a/Array/Solution_Array_6.py b/Array/Solution_Array_6.py
new file mode 100644
index 0000000..e430fa3
--- /dev/null
+++ b/Array/Solution_Array_6.py
@@ -0,0 +1,14 @@
+def MaxProduct(arr,n):
+    if n>1:
+        a=max(arr)
+        arr.remove(a)
+        return a*max(arr)
+    else:
+        return arr[0]
+
+n=int(input())
+arr=[int(i) for i in input().split()]
+print(MaxProduct(arr,n))
+
+
+#Time Complexity- O(N) 
\ No newline at end of file
diff --git a/Array/Solution_HashMap_1.py b/Array/Solution_HashMap_1.py
new file mode 100644
index 0000000..05b3b3f
--- /dev/null
+++ b/Array/Solution_HashMap_1.py
@@ -0,0 +1,16 @@
+def solve(arr,n):
+    Map=dict()
+    result=0
+    for key in arr:
+        if Map.get(key)!=None:
+            Map[key]+=1
+        else:
+            Map[key]=1    
+    for i in range(n):
+        if Map.get(arr[i]+1)!=None:
+            result+=1        
+    return result        
+
+n=int(input())
+arr=[int(i) for i in input().split()]
+print(solve(arr,n))
\ No newline at end of file
diff --git a/Array/Solution_HashMap_2.py b/Array/Solution_HashMap_2.py
new file mode 100644
index 0000000..b70f89d
--- /dev/null
+++ b/Array/Solution_HashMap_2.py
@@ -0,0 +1,23 @@
+def solve(arr,n,target):
+    Map=dict()
+    for key in arr:
+        if Map.get(key)!=None:
+            Map[key]+=1
+        else:
+            Map[key]=1
+    Pair=[]        
+    for A in arr:
+        B=target-A
+        if Map.get(B)!=None:
+            if Map[A]>0 and Map[B]>0:
+                Pair.append([A,B])
+            Map[A]-=1
+            Map[B]-=1
+
+    return Pair            
+
+
+n=int(input())
+arr=[int(i) for i in input().split()]
+target=int(input())
+print(solve(arr,n,target))
\ No newline at end of file
diff --git a/Array/Solution_Map_1.cpp b/Array/Solution_Map_1.cpp
new file mode 100644
index 0000000..f3f809e
--- /dev/null
+++ b/Array/Solution_Map_1.cpp
@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+	int n,count=0;
+	cin>>n;
+	vector<int> nums(n);
+	unordered_map<int,int> umap;
+	for(int i=0;i<n;i++)
+	{
+		cin>>nums[i];	
+		umap[nums[i]]++;
+	}
+	for(int i=0;i<n;i++)
+	{
+		if(umap.find(nums[i]+1)!=umap.end())
+			count++;
+	}	
+	cout<<count;		
+}
diff --git a/Array/Solution_Map_2.cpp b/Array/Solution_Map_2.cpp
new file mode 100644
index 0000000..9be8c02
--- /dev/null
+++ b/Array/Solution_Map_2.cpp
@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+	int n,target,count=0;
+	cin>>n>>target;
+	vector<int> nums(n);
+	unordered_map<int,int> umap;
+	for(int i=0;i<n;i++)
+	{
+		cin>>nums[i];
+		umap[nums[i]]++;
+	}
+	for(auto x:umap)
+	{
+		if(umap.find(target-x.first)!=umap.end()&&(x.first*2)!=target)
+		{
+			count+=min(umap[target-x.first],x.second);
+			umap.erase(target-x.first);
+		}
+	}
+	if(umap.find(target/2)!=umap.end()&&target%2==0)
+	count+=umap[target/2]/2;
+	cout<<count;		
+}
diff --git a/Assignment-1.pdf b/Assignment-1.pdf
new file mode 100644
index 0000000..fbaf53b
Binary files /dev/null and b/Assignment-1.pdf differ
diff --git a/Assignment-2.pdf b/Assignment-2.pdf
new file mode 100644
index 0000000..9959fbe
Binary files /dev/null and b/Assignment-2.pdf differ
diff --git a/Assignment-3.pdf b/Assignment-3.pdf
new file mode 100644
index 0000000..c0bc81b
Binary files /dev/null and b/Assignment-3.pdf differ
diff --git a/Assignment-4.pdf b/Assignment-4.pdf
new file mode 100644
index 0000000..881bb60
Binary files /dev/null and b/Assignment-4.pdf differ
diff --git a/Assignment-5.pdf b/Assignment-5.pdf
new file mode 100644
index 0000000..2e01bf0
Binary files /dev/null and b/Assignment-5.pdf differ
diff --git a/Coding Club_day1.docx b/Coding Club_day1.docx
deleted file mode 100644
index 7c183c6..0000000
Binary files a/Coding Club_day1.docx and /dev/null differ
diff --git a/README.md b/README.md
index 776d3e6..123be14 100644
--- a/README.md
+++ b/README.md
@@ -1,2 +1,4 @@
 # Coding-Interview-Question
-This repository is a collection of the interview questions which was mostly asked in a product based company.
+This repository is a collection of all the interview questions which was mostly asked in a product based company.
+
+### To send your submissions, send pull request and if you code will be correct, we will merge it
\ No newline at end of file
diff --git a/updated hash maps Q1 b/updated hash maps Q1
new file mode 100644
index 0000000..1691c35
--- /dev/null
+++ b/updated hash maps Q1	
@@ -0,0 +1,36 @@
+#include<iostream>
+#include<set>
+#include<iterator>
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+	int i,j,key,c=0; //used int variables
+	cout<<"enter size of the array required    ";
+	cin>>i; //taking size of the array
+	int *p = new int[i]; //dynamically allocating the array
+	cout<<"enter the array \n";
+	for(j=0;j<i;j++) //inputing the array
+	{ 
+	   cout<<"enter the "<<j+1<<"th element  ";
+		cin>>p[j];
+	}
+	set<int> set1; //transferring the array to a set for unique elements
+	set<int>:: iterator itr; //iterator for keeping track of the set1 used
+	for(j=0;j<i;j++) //transferring the array elements to set1
+	{
+		set1.insert(p[j]);
+	}
+	for(j=0;j<i;j++) //checking if the element+1 in array is present in the set1 
+	{
+		key = p[j]+1;
+		if(set1.count(key)) //if found the element in set increasing the counter.
+		{
+			c++;
+		}
+	}
+	cout<<"\n elements found are   ";
+	cout<<c; //printing the counter / output the value is divide by since it counts both ways .	
+}
+