Pregunta de entrevista de vAuto
Find max sum of subarray of size k within a given array.
Respuesta de la entrevista
Anónimo
20 nov 2019
private static int finMaxSum(int [] arr, int k) { int maxSum = 0; for (int i = 0; i = i) { int tempSum = arr[i]; for (int j = i + 1; j maxSum) { maxSum = tempSum; } } } return maxSum; }