Commit 04201c1

committed

update 1.1-maximum sum subarray of size k

1 parent 3ae605b commit 04201c1Copy full SHA for 04201c1

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -31,7 +31,7 @@ We can think of the 'k' as window size of sliding window in an array.`
`31`	`31`	`So, code for that condition:`
`32`	`32`
`33`	`33`	```java
`34`		`-public int voidmaxSumOfContiguousSubArray(int arr[], int k) {`
	`34`	`+public int maxSumOfContiguousSubArray(int arr[], int k) {`
`35`	`35`	`int maxSum = 0; // It will keep the maximum Sum of the subarrays`
`36`	`36`	`// with the size 'k' and it will have the result by the end of the for-loop`
`37`	`37`

Comments

(0)