leetle

Daily challenge for 2025-09-14

257. Maximum Average Subarray I

Given an array nums consisting of integers and an integer k, find a contiguous subarray of length k that has the maximum average value and return this value as a float.

Example:
Input: nums = [1,12,-5,-6,50,3], k = 4
Output: 12.75

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