alternative approach using deuque, but not monotonic decreasing deque

Requesting the time and space complexity of below code?

I think there's a less complex way still using queue.

incorrect space complexity

Why not return [max(arr[i:i+k]) for i in range(len(arr)-k+1)]

Problem 6: Max of All Subarrays of Size 'k'