DIY: 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 of the array to the very right. We can only see the k numbers in the window. Each time the sliding window moves right by one position.

Return the median array for each window in the original array. Answers within $10^{-5}$ ...