Given an array of integers nums and an integer k, return the maximum sum of a subarray of size k. A subarray is a contiguous part of the array. You must solve it in O(n) time complexity.

``` The solution utilizes a sliding window technique to maintain the sum of the current window of size k. It achieves O(n) complexity by updating the window sum by adding the next element and removing the first element of the previous window. ```