SDE - 1

Step 1: I knew this question is to be solved using dutch national flag algorithm.
Step 2: Declared 3 variables, low = 1, mid = 1, high = N
Step 3: I traversed the array from start to end till mid is less than high
Step 4: If current number at index i is 0, swap this number with element at low and increase both(low++, mid++)
Step 5: If current number at index i 1, simply do mid++
Step 6: If current number at index i is 2, swap this number with element at high and decrease both(high--, i--)
Step 7: Return the updated array

Step 1: Created deque and added first k element in it. But while adding we check if last element in deque is less than current element to be added, we remove that last element. We do this for all the elements left in deque and add current element only if elements at last of deque are greater
Step 2: Now run loop for remaining elements, firstly we print the first element of deque as it is our required answer for first window. Step 3 & Step 4 comes under for loop
Step 3: Then we remove the element from front of queue if they are out of the current window.
Step 4: Ans now before adding the current element we check same condition as done in step 1 before adding
Step 5: At last we print the first element of deque as it is answer for the last window.

Tip 1: I referred gfg and tutorials points for my preparation
Tip 2: I tried to cover all interview questions for these topics and it helped me a lot