Maximum Subarray Sum with Length at Most K

Given an integer array nums and an integer K, return the maximum sum of a non-empty contiguous subarray whose length is at most K.

Input Format

n K
nums[0] nums[1] ... nums[n-1...