Maximum of All Subarrays of Size K

Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size K.

Example:

Input:

T = 1
N = 6, K = 3
Array = [1, 3, 1, 2, 5, 3]

Output:

3 3 5 5

Explanation:

The subarrays are: [1, 3, 1], [3, 1, 2], [1, 2, 5], [2, 5, 3] - Maximums are 3, 3, 5, 5 respectively.

Constraints:

• 1 <= T <= 10
• 1 <= N <= 105
• 1 <= K <= N
• 1 <= arr[i] <= 109

Note:

Just implement the function as required; no need to handle input or output.