From 552f3723e5fa551f48db97dd4c85355ab8f42a12 Mon Sep 17 00:00:00 2001
From: yash <98970491+Yash636261@users.noreply.github.com>
Date: Sat, 1 Oct 2022 19:42:35 +0530
Subject: [PATCH 1/4] Create find_max.cpp

---
 CPP/array-2d/find_max.cpp | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 CPP/array-2d/find_max.cpp

diff --git a/CPP/array-2d/find_max.cpp b/CPP/array-2d/find_max.cpp
new file mode 100644
index 00000000..c74270c8
--- /dev/null
+++ b/CPP/array-2d/find_max.cpp
@@ -0,0 +1,24 @@
+#include<iostream.h>
+using namespace std;
+void max(int arr[5])
+{
+    int max[5];
+    max[0]=0;
+    int k=0;
+    for(int i=0;i<5;i++)
+    {
+     if(arr[i]>max[k])
+       max[k]=arr[i];
+    }
+    cout<<"maximum number is:"<<max[k];
+}
+int main(){
+    int arr[5],i;
+    cout<<"enter members of an array:"<<endl;
+    for(i=0;i<5;i++)
+    {
+        cin>>arr[i];
+    }
+    max(arr);
+    return 0;
+}

From c7058122dc0af3cceacbb7d766f257ba990a6b31 Mon Sep 17 00:00:00 2001
From: yash <98970491+Yash636261@users.noreply.github.com>
Date: Sat, 1 Oct 2022 19:43:23 +0530
Subject: [PATCH 2/4] Create find_triplet.cpp

---
 CPP/array-2d/find_triplet.cpp | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 CPP/array-2d/find_triplet.cpp

diff --git a/CPP/array-2d/find_triplet.cpp b/CPP/array-2d/find_triplet.cpp
new file mode 100644
index 00000000..ff057cd3
--- /dev/null
+++ b/CPP/array-2d/find_triplet.cpp
@@ -0,0 +1,27 @@
+
+#include<iostream>
+using namespace std;
+void exp(int arr[],int n,int target){
+    for(int i=0;i<n;i++){      
+        for(int j=0;j<n;j++){
+            for(int k=0;k<n;k++){
+                if(arr[i]+arr[j]+arr[k]==target){
+                    if(arr[i]<arr[j]&&arr[j]<arr[k]){
+                    cout<<"("<<arr[i]<<","<<arr[j]<<","<<arr[k]<<")"<<endl;
+                    }
+                }
+            }
+        }
+    }
+}
+int main(){
+    int arr[]={2,7,4,0,9,5,1,3};
+    int n=sizeof(arr)/sizeof(arr[0]);
+    int target=6;
+    exp(arr,n,target);
+    return 0;
+}
+Footer
+© 2022 GitHub, Inc.
+Footer navigation
+Te

From 29753f6fb381db9774c967dcc9d0390d938aa0ef Mon Sep 17 00:00:00 2001
From: yash <98970491+Yash636261@users.noreply.github.com>
Date: Sat, 1 Oct 2022 19:44:13 +0530
Subject: [PATCH 3/4] Create rodate_array.cpp

---
 CPP/array-2d/rodate_array.cpp | 43 +++++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 CPP/array-2d/rodate_array.cpp

diff --git a/CPP/array-2d/rodate_array.cpp b/CPP/array-2d/rodate_array.cpp
new file mode 100644
index 00000000..7255bb15
--- /dev/null
+++ b/CPP/array-2d/rodate_array.cpp
@@ -0,0 +1,43 @@
+#include<iostream>
+using namespace std;
+
+void rotate(int arr[],int n,int d)
+{
+    int temp[n];
+    int j=0;  
+    for(int i=d;i<n;i++)
+    {
+        temp[j]=arr[i];
+        j++;
+    } 
+    for(int i=0;i<d;i++)
+    {
+        temp[j]=arr[i];
+        j++;
+    }
+    for(int i=0;i<n;i++)
+    {
+        arr[i]=temp[i];
+    }
+}
+void print(int arr[ ],int n)
+{
+    for(int i=0;i<n;i++){
+        cout<<arr[i]<<endl;
+    }
+}
+int main()
+{
+	int n,i,d, arr[10];
+	
+	cout << "\nPlease Enter the Array Size =  ";
+	cin >> n;
+    cout<<"enter array elements:"<<endl;
+    d=2;
+    for(i=0;i<n;i++){
+        cin>>arr[i];
+    }
+    rotate(arr,n,d);
+    print(arr,n);
+ 	return 0;
+}

From 88dca44bd2d21ac33a9029f799bf0f3cc585cd4c Mon Sep 17 00:00:00 2001
From: yash <98970491+Yash636261@users.noreply.github.com>
Date: Sat, 1 Oct 2022 19:45:14 +0530
Subject: [PATCH 4/4] Create find_3rd_max.cpp

---
 CPP/array-2d/find_3rd_max.cpp | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 CPP/array-2d/find_3rd_max.cpp

diff --git a/CPP/array-2d/find_3rd_max.cpp b/CPP/array-2d/find_3rd_max.cpp
new file mode 100644
index 00000000..8e425379
--- /dev/null
+++ b/CPP/array-2d/find_3rd_max.cpp
@@ -0,0 +1,27 @@
+#include<iostream>
+using namespace std;
+void third(int arr[],int n){
+int first=arr[0];
+int j=0;
+    for(int i=0;i<n;i++)
+    {
+         if(arr[i]>first)
+           first=arr[i];
+    }
+    int second = INT_MIN;
+    for (int i = 0; i < n; i++)
+        if (arr[i] > second && arr[i] < first)
+            second = arr[i];
+
+    int third = INT_MIN;
+    for (int i = 0; i < n; i++)
+        if (arr[i] > third && arr[i] < second)
+            third = arr[i];
+    cout<<third;
+}
+int main(){
+    int arr[]={1,34,65,87,9,78};
+    int n=sizeof(arr)/sizeof(arr[0]);
+    third(arr,n);
+    return 0;
+}