- List of question
- [Skip] Sliding Window Maximum (Maximum of all subarrays of size k) – Given an array and an integer k, find the maximum for each and every contiguous subarray of size k. Youtube. We are skipping this question as it the dequeue implementation is tough and not worth the time. It will be difficult to reproduce the same in an interview env. We will have to check the BST implementation for the same.