add GFG codes of arrays

Author: paarth14

Vectors/(GEEKSFORGEEKS)Count of smaller elements.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	//code
+	int t;
+	cin>>t;
+	
+	while(t--)
+	{
+	    int n;
+	    cin>>n;
+	    
+	    int arr[n];
+	    for(int i=0; i<n; i++)
+	    {
+	        cin>>arr[i];
+	    }
+	    int x;
+	    cin>>x;
+	    int answer = 0;
+	    for(int i=0; i<n; i++)
+	    {
+	        if(arr[i]<=x)
+	        {
+	            answer++;
+	        }
+	               
+	    }
+	    cout<<answer<<endl;
+	}
+	return 0;
+}

Vectors/(GEEKSFORGEEKS)Display longest name.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	//code
+	int t;
+	cin>>t;
+	
+	while(t--)
+	{   
+	       int n;
+	       cin>>n;
+	        
+	       string a[n];
+	       
+	    for(int i=0; i<n; i++)
+	    {
+	        
+	        cin>>a[i];
+	        
+	        
+	        
+	    }
+	    string max= " ";
+	    int min=0;
+	    for(int i=0; i<n; i++)
+	    {
+	        if(a[i].length()>min)
+	        {
+	            min = a[i].length();
+	            max = a[i];
+	        }
+	        
+	    }
+	    cout<<max<<endl;
+	}
+	return 0;
+}

Vectors/(GEEKSFORGEEKS)Multiply Array.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	//code
+	int t;
+	cin>>t;
+	
+	while (t--)
+	{
+	    int n;
+	    cin>>n;
+	    int arr[n], product=1;
+	    for(int i=0; i<n; i++)
+	    {
+	        cin>>arr[i];
+	        product *= arr[i];
+	        
+	    }
+	    cout<<product<<endl;
+	}
+	return 0;
+}

Vectors/(GEEKSFORGEEKS)Print the left element.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+	//code
+	int t;
+	cin>>t;
+	
+	while(t--)
+	{
+	    int n;
+	    cin>>n;
+	    
+	    int arr[n];
+	    for(int i=0; i<n; i++)
+	    {
+	        cin>>arr[i];
+	    }
+	    sort(arr,arr+n);
+	    if(n%2==0){
+	        cout<<arr[(n/2)-1]<<endl;
+	    }
+	    else{
+	        cout<<arr[n/2]<<endl;
+	    }
+	}
+	return 0;
+}

Vectors/(GEEKSFORGEEKS)Reverse an array.cpp

@@ -0,0 +1,29 @@
+#include<iostream>
+using namespace std;
+
+int main() {
+	//code
+	int t;
+	cin>>t;
+	
+	while(t--)
+	{
+	    int n;
+	    cin>>n;
+	    int arr[n];
+	    
+	    for(int i=0; i<n; i++)
+	    {
+	        cin>>arr[i];
+	        
+	    }
+	    for(int i=n-1; i>=0; i--)
+	    {
+	        
+	        cout<<arr[i]<<" ";
+	    }
+	    cout<<endl;
+	    
+	}
+	return 0;
+}

Vectors/(GEEKSFORGEEKS)Sum of arrays.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	//code
+	int t;
+	cin>>t;
+	
+	while(t--)
+	{
+	    int n;
+	    cin>>n;
+	    
+	    int arr[n], sum=0;
+	    for(int i=0; i<n; i++)
+	    {
+	        cin>>arr[i];
+	        sum += arr[i];
+	        
+	    }
+	    cout<<sum<<endl;
+	}
+	return 0;
+}

Vectors/(GEEKSFORGEEKS)Sum of elements in a array.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+    int t;
+    cin>>t;
+    
+    
+    while(t--)
+    {
+        int n;
+        cin>>n;
+        int arr[n], sum=0;
+        for(int i=0; i<n; i++)
+        {
+            cin>>arr[i];
+            sum += arr[i];
+        }
+        cout<<sum<<endl;
+        
+        
+    }
+    return 0;
+}

Vectors/(GEEKSFORGEEKS)Sum of series.cpp

@@ -0,0 +1,32 @@
+// { Driver Code Starts
+#include <bits/stdc++.h>
+
+using namespace std;
+
+ // } Driver Code Ends
+
+
+//User function template for C++
+class Solution{
+public:
+	// function to return sum of  1, 2, ... n
+	long long seriesSum(int n) {
+	    // code here
+	    return ((long long)n*(long long)(n+1))/2;
+	}
+};
+
+// { Driver Code Starts.
+
+int main() {
+    int t;
+    cin >> t;
+    while (t--) {
+        int n;
+        cin >> n;
+        Solution ob;
+        auto ans = ob.seriesSum(n);
+        cout << ans << "\n";
+    }
+    return 0;
+}  // } Driver Code Ends

Vectors/(GEEKSFORGEEKS)check if array is sorted or not.cpp

@@ -0,0 +1,51 @@
+// { Driver Code Starts
+//Initial template for C++
+
+#include<bits/stdc++.h>
+using namespace std;
+
+ // } Driver Code Ends
+
+
+//User function template for C++
+
+class Solution{   
+public:
+    bool arraySortedOrNot(int arr[], int n) {
+        // code here
+        if (n==0||n==1)
+        {
+            return true;
+        }
+        for(int i=1; i<n; i++)
+        {
+            if(arr[i-1]>arr[i])
+            {
+                return false;
+            }
+        }
+        return true;
+    }
+};
+
+// { Driver Code Starts.
+
+int main() {
+    int t;
+    cin >> t;
+    while (t--) {
+        int n;
+        cin >> n;
+        int arr[n];
+        for (int i = 0; i < n; i++) {
+            cin >> arr[i];
+        }
+        Solution ob;
+        bool ans = ob.arraySortedOrNot(arr, n);
+        cout << ans << "\n";
+
+    }
+    return 0;
+}
+
+  // } Driver Code Ends

Vectors/(GEEKSFORGEEKS)display the largest element of array.cpp

@@ -0,0 +1,34 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	//code
+	int t;
+	cin>>t;
+	
+	while(t--)
+	{
+	    int n;
+	    cin>>n;
+	    
+	    int arr[n];
+	    for(int i=0; i<n; i++)
+	    {
+	        cin>>arr[i];
+	        
+	    }
+	    int count=0;
+	    for(int i=0; i<n; i++)
+	    {
+	        if (count<arr[i])
+	        {
+	            count = arr[i];
+	            
+	        }
+	        
+	    }
+	    cout<<count<<endl;
+        
+	}
+	return 0;
+}