Welcome to the daily solving of our PROBLEM OF THE DAY with Yash Dwivedi. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Recursion but also build up problem-solving skills.

In this problem, we are given an array a of length n and a number k, find the largest sum of the subarray containing at least k numbers. It is guaranteed that the size of array is at-least k.

Example :

Input : 
n = 4
a[] = {1, -2, 2, -3}
k = 2
Output : 
1

Explanation :
The sub-array of length at-least 2 that produces greatest sum is {1, -2, 2}

Give the problem a try before going through the video. All the best!!!
Problem Link: https://www.geeksforgeeks.org/problems/largest-sum-subarray-of-size-at-least-k3121/1