Interview problem - maximum element in window of size k

[f2016115 (SHUBHAM SHARMA)]

In the deque approach also the worst case complexity is 0(n.k) so how is it better than bruteforce ?