Maximum element in window size of k

#1

My code is Showing Tle i dont know whats wrong please help me and tell me what modifications in my code is required
Code link:: https://ide.codingblocks.com/s/99483

#2

Hi @sunny.kumar2016
The complexity for your code is O( t * k * n ). Since values of k and n are large , this will give you a TLE.
You should use sliding window technique to optimise this , otherwise there is simply no point in using deque in this question.