sir at first i was solving this pro by nested for loop…i get TLE in one of my test case
then i improved my code and code it in recursion way…ans now i m getting only a single test case passed,nearly 8 or 9 test case shows run time error ans time limit exceeded
Brute Force : Run two loops. In the outer loop, take all subarrays of size K. In the inner loop, get the maximum of the current subarray.
Efficient Approach - (Sliding Window Technique using Deque)
We create a Deque, Qi of capacity k, that stores only useful elements of current window of k elements. An element is useful if it is in current window and is greater than all other elements on left side of it in current window. We process all array elements one by one and maintain Qi to contain useful elements of current window and these useful elements are maintained in sorted order. The element at front of the Qi is the largest and element at rear of Qi is the smallest of current window.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.