Sliding Window Technique : Maximum sum of k-Subarray problem using sliding window technique.

An example problem of calculating the maximum sum of the sub array of size k explained with the brute force method and then optimized using the sliding window technique.

[velanganniinbaraj]

Simple and clear explanation.Thank you..

[chrisisherewhat]

Very simple and easy explanation of the sliding window technique. Thanks a lot :)

[Happymejoyus]

The brute force approach does not seem correct. I am trying to implement that way, not working out for me.

[saisrikar]

Excellent Explanation ..Thanks a lot!!

[shridharparameshwarbhat]

Shridhar Here, your 1st pu classmate. Watching the video now. good job :)