Given an array of integers Arr and a number k, return the maximum sum of a subarray of size k using a brute force approach.
{
"arr": [
2,
5,
1,
8,
2,
9,
1
],
"k": 3
}19{
"arr": [
100,
200,
300,
400
],
"k": 2
}700{
"arr": [
1,
4,
2,
10,
23,
3,
1,
0,
20
],
"k": 4
}39Sign in to Run Code and Submit