357. Maximum Sum Fixed Subarray

Given an array of integers nums and an integer k, find the maximum sum of any contiguous subarray of length k. You can assume nums.length >= k.

Example:
Input: nums = [2, 1, 5, 1, 3, 2], k = 3 Output: 9

Run this challenge interactively in Python or JavaScript when the app loads.