11.md

< a href="https://www.geeksforgeeks.org/problems/largest-sum-subarray-of-size-at-least-k3121/1">Largest Sum Subarray of size atleast k

long long int maxSumWithK(long long int a[], long long int n, long long int k) 
    {
       long long int ans=INT_MIN;
        long long int sum=0;
        long long int last=0;
        long long int j=0;
        for(long long int i=0;i<n;i++){
            sum+=a[i];
            if(i-j+1==k){
                ans=max(ans,sum);
            }
            else if(i-j+1>k){
                last+=a[j];
                j++;
                if(last<=0){
                    sum-=last;
                    last=0;
                }
                ans=max(ans,sum);
            }
        }
        return ans;
    }