← Questions
Largest and smallest median over length-k subsequences
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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 official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding