Added problems

Author: Mehulcoder

Prerequisites/.gitignore

@@ -0,0 +1,2 @@
+4
+1 2 3 4

Time-complexity-analysis/Input.txt

@@ -0,0 +1,91 @@
+/*
+
+				Name: Mehul Chaturvedi
+				IIT-Guwahati
+
+*/
+
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long long ll;
+
+ll kadane(int arr[], int n){
+	ll curr_sum = 0;
+	ll max_so_far = INT_MIN;
+	for (int i = 0; i < n; ++i)
+	{
+		curr_sum = curr_sum +arr[i];
+		if (max_so_far<curr_sum)
+		{
+			max_so_far = curr_sum;
+		}
+
+		if (curr_sum<0)
+		{
+			curr_sum = 0;
+		}
+	}
+	return max_so_far;
+}
+ll maxSubarraySum(int* arr,int n,int k){
+	ll kadanes_sum = kadane(arr, n);
+	if (k==1)
+	{
+		return kadanes_sum;
+	}
+
+	ll curr_prefix_sum=0, curr_sufffix_sum=0;
+	ll max_prefix_sum=INT_MIN, max_suffix_sum=INT_MIN;
+
+	for (int i = 0; i < n; ++i)
+	{
+		curr_prefix_sum = curr_prefix_sum + arr[i];
+		max_prefix_sum = max(max_prefix_sum, curr_prefix_sum);
+	}
+	ll totalSum = curr_prefix_sum;
+	for (int i = n-1; i >=0; --i)
+	{
+		curr_sufffix_sum += arr[i];
+		max_suffix_sum = max(max_suffix_sum, curr_sufffix_sum);
+	}
+
+	ll ans;
+	if (totalSum<0)
+	{
+		ans=max(max_suffix_sum+max_suffix_sum, kadanes_sum);
+	}else{
+		ans = max(max_suffix_sum+max_prefix_sum+totalSum*(k-2), kadanes_sum);
+	}
+	return ans;
+
+
+
+}
+int main( int argc , char ** argv )
+{
+	ios_base::sync_with_stdio(false) ; 
+	cin.tie(NULL) ; 
+	
+	int t;
+	cin>>t;
+	while(t--){
+		int n,k;
+		cin>>n>>k;
+		int arr[n];
+		for (int i = 0; i < n; ++i)
+		{
+			std::cin>>arr[i];
+		}
+		cout << maxSubarraySum(arr, n, k)  << '\n';
+
+	}
+
+
+	return 0 ; 
+
+
+
+}

Time-complexity-analysis/K-Concatenation

@@ -0,0 +1,46 @@
+/*
+
+				Name: Mehul Chaturvedi
+				IIT-Guwahati
+
+*/
+
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+
+int main( int argc , char ** argv )
+{
+	ios_base::sync_with_stdio(false) ; 
+	cin.tie(NULL) ; 
+	
+	int n;
+	cin>>n;
+	int* arr=new int[n];
+
+	for (int i = 0; i < n; ++i)
+	{
+		cin>>arr[i];
+	}
+
+	long double sum=0;
+
+	for (int i = 0; i < n; ++i)
+	{
+		sum+=(long double)log10(arr[i]);
+	}
+
+	for (int i = 0; i < n; ++i)
+	{
+		cout << int(pow((long double)10.00, sum-log10(arr[i]))) << " ";
+	}
+
+
+
+	return 0 ; 
+
+
+
+}