Sign in Get Started

largest subarray of sum k

Stanley 
def smallestSubWithSum(arr, n, x):
 
    # Initialize current sum and minimum length
    curr_sum = 0
    min_len = n + 1
 
    # Initialize starting and ending indexes
    start = 0
    end = 0
    while (end < n):
 
        # Keep adding array elements while current
        # sum is smaller than or equal to x
        while (curr_sum <= x and end < n):
            curr_sum += arr[end]
            end += 1
 
        # If current sum becomes greater than x.
        while (curr_sum > x and start < n):
 
            # Update minimum length if needed
            if (end - start < min_len):
                min_len = end - start
 
            # remove starting elements
            curr_sum -= arr[start]
            start += 1
 
    return min_len
View another examples Add Own solution
Log in, to leave a comment

4.25
8
Reader 100 points 

                                    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) &gt; k: # Shrink the array from the left, until the sum is &lt;= k.
           current = current[1:]
        if sum(current) == k:
            max_len = max(max_len, len(current))

    return max_len

4.25 (8 Votes)
0
0
10
Abid 140 points 

                                    //variable size sliding window
#include &lt;bits/stdc++.h&gt;

using namespace std;

int main()
{
    int n;
    cout&lt;&lt;&quot;Enter the size of the array:&quot;&lt;&lt;endl;
    cin&gt;&gt;n;
    int arr[n];
    cout&lt;&lt;&quot;Enter the elements of the array:&quot;&lt;&lt;endl;
    for(int i=0;i&lt;n;i++)
    {
        cin&gt;&gt;arr[i];
    }
    int k;
    cout&lt;&lt;&quot;enter the sum whose longest subarray you want to find:&quot;&lt;&lt;endl;
    cin&gt;&gt;k;
    int i=0,j=0,sum=0;
    int mx=0;
    while(j&lt;n)
    {
        sum=sum+arr[j];
        if(sum&lt;k)
        {
            j++;
        }
        else if(sum==k)
        {
            mx=max(mx,j-i+1);
            j++;
        }
        else
        {
            while(sum&gt;k)
            {
                sum=sum-arr[i];
                i++;
            }
            j++;
        }
    }
    cout&lt;&lt;mx&lt;&lt;endl;
    return 0;
}

0
0
5
1
Yapishkahilt 220 points 

                                    //variable size sliding window
#include &lt;bits/stdc++.h&gt;

using namespace std;

int main()
{
    int n;
    cout&lt;&lt;&quot;Enter the size of the array:&quot;&lt;&lt;endl;
    cin&gt;&gt;n;
    int arr[n];
    cout&lt;&lt;&quot;Enter the elements of the array:&quot;&lt;&lt;endl;
    for(int i=0;i&lt;n;i++)
    {
        cin&gt;&gt;arr[i];
    }
    int k;
    cout&lt;&lt;&quot;enter the sum whose longest subarray you want to find:&quot;&lt;&lt;endl;
    cin&gt;&gt;k;
    int i=0,j=0,sum=0;
    int mx=0;
    while(j&lt;n)
    {
        sum=sum+arr[j];
        if(sum&lt;k)
        {
            j++;
        }
        else if(sum==k)
        {
            mx=max(mx,j-i+1);
            j++;
        }
        else
        {
            while(sum&gt;k)
            {
                sum=sum-arr[i];
                i++;
            }
            j++;
        }
    }
    cout&lt;&lt;mx&lt;&lt;endl;
    return 0;
}

5 (1 Votes)
0
Are there any code examples left?
Find Add Code snippet
New code examples in category C++
SHOW MORE
Create a Free Account
Unlock the power of data and AI by diving into Python, ChatGPT, SQL, Power BI, and beyond.
Sign up
Develop soft skills on BrainApps
Complete the IQ Test
Relative searches
maximum of subarrays of size k longest subarray having sum k max subarray sum no larger than k Maximum of all subarrays of size k*k maximum sum of k size subarray maximum sum if k size subarray smallest subarray with sum atleast k largest sub array sum subarray of size k with maximum sum longest subarray sum minimum number of elements in subarray with given sum maximu size subarray with sum k maximum subarray with given sum find minimum subarray equal to sum k minimum subarray of given sum Subarray Sum Equals at least K largest sum of contiguous subarray Find Longest Subarray With Sum &gt;= K. Kth largest sum continuous subarrays minimum length subarray with sum at least k maximum subarray sum at most K given an array of integers, find the longest subarray with gcd &gt; 1 maximum of subarray size k Maximum Sum Subarray with at least Size K Sum of minimum and maximum elements of all subarrays of size &ldquo;k&rdquo;. minimum sub matrix with sum k minimum size of sub matrix in a matrix with sum k find minimum of all subarrays of size k maximum length subarray with sum equals k largest k sublist sum find maximum sum of a subarray length of maximum sum subarray less than k smallest subarray with sum k from an array Find minimum sum subarray of size `k` find the sum of maximum subarray K-th Largest Sum Contiguous Subarray minimum of all subarrays of size k 3 number with largest sum subarray minimum sum in k subarrays minimum sum in k subarray find largest sum continuous sub array find longest subarray sum find maximum sum of subarray max subarray of sum k longest subarray with sum 0 largest contiguous subarray sum Largest sum subarray of size K containing consecutive elements publish maximum sub array sum with size k python maximum sub array sum with size k largest subarray of sum k hackerrank solution find maximum sum of a subarray of size k python find maximum sum of a subarray of size k largest sum subarray with at-least k numbers maximum subarray sum of k size largest contiguous subarray of length k maximum sum of continuous subarray of size k smallest subarray with sum at least k Split Array Largest Sum into m subarrays having k minimum maximum sum Largest sum subarray of size K containing consecutive elements Max Sum Subarray of size K practice minimum subarray exceeding given sum max sum of contiguous subarray of size k longest k sum subarray subarray sum at least k 2. Maximum Sum Subarray of Size K (easy) Find Minimum Length Sub Array With Sum K longest sub array with sum k Largest Sum Subarray of Size at least K max size subarray sum equals k find the length of the longest Sub-Array with sum of the elements equal to the given value K min subarray length to given sum find the subarray with maximum sum length of longest contiguous subarray largest sum subarray indexes sum minimum max subarrays of size k algorithm to find maximum subarray sum Maximum Sum Subarray of Size K (easy) k-th largest sum contiguous subarray gfg practice subarray of size 'k' with maximum sum. find the longest subarray with given sum maximum sum subarray with at least k elements longest length subarray sorted find the longest subarray with the same number of find the largest sum contiguous subarray max sum of subarray no larger than k maximum subarray sum not larger than k find a subarray that contains the largest sum less than k max sum subarray less than k find the k-subarray with the minimum sum find the subarray with the minimum sum k find the maximum sum of subarray of size of k maximum of k size subarray Smallest sum subarray size Smallest sum contiguous subarray size length of the longest subarray having sum equal to k largest subarray of sum k practice minimum length subarray with sum k maximum subarray of size k smallest subarray with sum k maximum sum of all subarrays of size k Minimum Size Subarray Sum interviebit Find the largest subarray sum with sum atmost k sum of subarray size having maximum int k sum of subarray size with maximum int k largest sum contiguous subarray kth largest sum contiguous subarray gfg practice largest sum subarray python minimum size subrrray sum how find maximum subarray sum write a program that find largest sum of subarray longestsubarray with given sum Maximum Size Subarray Sum Equals k Minimum Size Subarray Sum Maximum sum subarray of size k; maximum sum of a subarray of size k minimum size subarray sum gfg maximum sum of contiguous subarray of size k minimum sum subarray of size k gfg largest subarray sum in array longest subarray length with same elements Given an array, find the length of the longest subarray whose sum is 0 maximum subarray sum less than k find sub array from array which has the largest sum how is shortest subarray sum at least k different from minimum size subarray sum find the length of largest subarray minimum subarray with given sum max sum of subarray of size k maximum sum k-disjoint subarrays of length l find subarray with max sum*size maximum sum of subarray of size k Sum of minimum and maximum elements of all subarrays of size k. find the minimum element from all the subarrays of size k longest length subarray of sum k find k subarray with maximum sum how to find maximum subarray sum maximum sum of k subarrays minimum subarray sum maximum subarray sum of size k Maximum and minimum of all subarrays of size k longest subarray such that its sum is non negative minimum of subarray of size k longest subarray with consecutive elements Longest subarray with a given sum max sum subarray of size k practise largest sum of subarray subarray of size k with given sum max sum subarray of size k find the sum of subarrays of size k Minimum sum subarray of size k find longest subarray sum code signinal largest sum subarray Maximum Sum Subarray of size K minimum subarray size &gt;k longest subarray of sum k gfg practice minimum subarray size with sum &gt;k to find largest subarray sum find maximum subarray sum how to find maximum sum of subarray in a arrary get the longest subarray of an array longest subarray solution biggest sum of subarray largest subarray length with given sum how to find maximum sum of subarray Finding the longest subarray with sum 0 in the binary array. given an array of integers what is the length of the longest subarray containing no more than two find maximum sum subarray find maximum sum contiguous subarray largest sum in subArray find subarray with maximum sum find longest arithmetic subarray find largest sum of contiguous subarray longest subarray with sum divisble byk find the maximum sum of subarray longest contiguous subarray find largest sum contiguous subarray gfg return longest subarray find the maximum subarray sum find the maximum subarray sum for a given array find the largest sum subarray longest sum subarray largest subarry sum in an array Longest Subarray Sum at Most K finding longest subarray with positive sum longest subarray with postive sum longest subarray with k sum longest subarray sum less than k longest sum subarray only positive longest subarray sum 0 largest subarray sum find the longest subarray which sum is uneven find the longest subarray which sum is odd given an array of integers what is the length of the longest subarray longest sum contiguous subarray longest subarray with 0 sum Find maximum length sub-array having given sum longest subarray length whose sum is not divisible by k how to find longest subarray sum position of the Longest subarray with all elements same Shortest Subarray with Sum K longest subarray with sum greater than k maximum subarray sum k longest subsequence with sum k find Largest sum contiguous Subarray maximum subarray of sum k longest subarray with 0 sum leetcode find subarray sum binary search of the longest substring having sum k binary search of the largest substring having sum k longest subsequence with sum = k ongest Subarray with a Sum Constraint Given an array containing N integers and an integer K. Your task is to find the length of the longest Sub-Array with sum of the elements equal to the given value K. Longest subarray with sum Find the longest subarray that equals K Largest Subarray of sum K longest subarray by sum longest subaary with given sum longest subsequence with sum equals to k longest subarray with sum &gt;k Given an array arr[] of size N containing integers. The task is to find the length of the longest sub-array having sum equal to the given value K. maximum subarray with sum k sum of maximum length subarray of given sum snum of maximum length subarray of given sum largest subbarray with given sum longest sub array problems gfg longest subarray sum atleast k longest subarray with sum at ;east k with negative numbers longest subarray of sum k largest subarray of given sum Q3 - Arbitrary Shopping : Find the length of the longest sub-array such that sum of elements does not exceed &lsquo;k&rsquo;. longest subarray with sum 1 largest subarray with k sum length of longest subarray with sum k longest subarray with sum k only positive integers longest subarray with a givwn sum subarray sum equals length of sub array sum of elements of subarray equals length of sub array sum of elements of subarray = length of sub array largest subarray with sum k maximum subarray k sum largest subarray with given sum find longest subarray by sum Longest Sub-Array with Sum K in O(n) and O(1) space longest subarray with sum=k maximum subarray sum k steps find maximum length subarray having given sum Longest sub-array having sum k Longest sub-array having sum k javascript Longest sub-array having sum k js maximum-size-subarray-sum-equals-k maximum length subarray with given sum largeset sequence of sum &gt; k Longest Sub-Array with Sum K longest subarray with given sum longest subarray with sum k largest contiguous subarray with sum k
Made with love
This website uses cookies to make IQCode work for you. By using this site, you agree to our cookie policy

Welcome Back!

Sign up to unlock all of IQCode features:
  • Test your skills and track progress
  • Engage in comprehensive interactive courses
  • Commit to daily skill-enhancing challenges
  • Solve practical, real-world issues
  • Share your insights and learnings
Create an account
Sign in
Recover lost password
Or log in with
Not registered?
Sign up takes less than a minute

Create a Free Account

Sign up to unlock all of IQCode features:
  • Test your skills and track progress
  • Engage in comprehensive interactive courses
  • Commit to daily skill-enhancing challenges
  • Solve practical, real-world issues
  • Share your insights and learnings
Create an account
Sign up
Or sign up with
By signing up, you agree to the Terms and Conditions and Privacy Policy. You also agree to receive product-related marketing emails from IQCode, which you can unsubscribe from at any time.
Creating a new code example
Code snippet title
Source