Sliding window problem

  1. List of question
  2. [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.
Advertisements

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s