find longest subarray by sum
def max_length(s, k):
current = []
max_len = -1 # returns -1 if there is no subsequence that adds up to k.
for i in s:
current.append(i)
while sum(current) > k: # Shrink the array from the left, until the sum is <= k.
current = current[1:]
if sum(current) == k:
max_len = max(max_len, len(current))
return max_lenfind maximum sum in array of contiguous subarrays
#include <iostream>
using namespace std;
int main(){
//Input Array
int n;
cin >> n;
int arr[n];
for(int i =0;i< n;i++){
cin >> arr[i];
}
int currentSum = 0;
int maxSum = INT_MIN;
//algo
for (int i = 0; i < n; i++)
{
currentSum += arr[i];
if (currentSum <0)
{
currentSum = 0;
}
maxSum = max(maxSum, currentSum);
}
cout << maxSum << endl;
return 0;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
