Finding the subsequence with the least median given a size K and an array of length N
I have been struggling the past month with this problem that was given to us on our course while I was upsolving it. The task is to find the window of size K with the least median in an array of integers. It is also worth noting that K will always be odd, so we need not be worried about even length sequences.