export function maxWindowSum(numbers: number[], k: number): number {
  // Escribe tu solución aquí
  if(numbers.length < k) return -1;

  let currentMaxSum = 0;

  for(let i = 0; i< numbers.length; i++){
   
    const sum = numbers.slice(i,(k+i)).reduce((acc,c) => acc+c,0);
  
    if( !isNaN(sum) && (currentMaxSum < sum)) currentMaxSum = sum;
    if(i === 0) currentMaxSum = sum;
  }

  return currentMaxSum;
}