Sliding Window Maximum | Dataford Interview Questions

Find the Sliding Window Maximum across an array.

Asked in the Phone Screen Round 2 stage. This is the LeetCode Sliding Window Maximum problem.

Given an integer array nums and integer k, return the maximum value in every contiguous subarray of length k, from left to right.

Contract

Input: nums, a non-empty list of integers, and k, where 1 <= k <= len(nums).
Output: A list containing len(nums) - k + 1 integers.

def max_sliding_window(nums, k):

Your question is Sliding Window Maximum. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Find the Sliding Window Maximum across an array.

Asked in the Phone Screen Round 2 stage. This is the LeetCode Sliding Window Maximum problem.

Given an integer array nums and integer k, return the maximum value in every contiguous subarray of length k, from left to right.

Input: nums, a non-empty list of integers, and k, where 1 <= k <= len(nums).
Output: A list containing len(nums) - k + 1 integers.

def max_sliding_window(nums, k):

Your question is Sliding Window Maximum. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.