Sliding Window Median

Try to solve the Sliding Window Median problem.

Statement

Given an integer array, nums, and an integer, k, there is a sliding window of size k, which is moving from the very left to the very right of the array. We can only see the k numbers in the window. Each time the sliding window moves right by one position.

Given this scenario, return the median of the each window. Answers within 10−510^{-5} of the actual value will be accepted.

Constraints:

  • 1≤1 \leq k ≤\leq nums.length ≤103\leq 10^3
  • −231≤-2^{31} \leq nums[i] ≤231−1\leq 2^{31} - 1

Examples

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy