Sliding Window — Turning O(n²) to O(n)

Assume you are given an array:
[2, 1, 5, 1, 3, 2]
and an integer k=3
You are supposed to find the maximum sum of subarray of size=k.