Solving Sliding Window Median in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.

Examples:

For example,

Window position                Median
---------------               -----
[1  3  -1] -3  5  3  6  7       1
 1 [3  -1  -3] 5  3  6  7       -1
 1  3 [-1  -3  5] 3  6  7       -1
 1  3  -1 [-3  5  3] 6  7       3
 1  3  -1  -3 [5  3  6] 7       5
 1  3  -1  -3  5 [3  6  7]      6

See the full details of the problem Sliding Window Median at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go