Largest and smallest median over length-k subsequences
Given an array and an integer k, consider every subsequence of length k and its median. Return the largest and the smallest of those medians.
No answer yet. Write the first one; the best answer gets endorsed.
