What is the time complexity of finding the maximum sum subarray of size k using the sliding window approach?

Question

Accepted Answer

(C) O(n). Explanation: Sliding window maintains a running sum, adding one element and removing one per slide → O(n) total.