Medians

Problem Statement

Medians Problem Description A new Amazon intern encountered a challenging task. Currently, the intern has n integers, where the value of the i -th element is represented by the array element values[i] . The intern is curious to play with arrays and subsequences and thus asks you to join him. Given n integers, an array values , and an integer k , the intern needs to find the maximum and minimum overall median subsequences of length k . Function Description Complete the function medians in the editor below. The function is expected to return an INTEGER_ARRAY . The function accepts the following parameters: int values_count : The number of elements in the values array. int values[] : The array of integers. int k : The desired length of subsequences. Returns int[] : An array containing two integers in the format [maximum median, minimum median] . Note on C implementation: The function should return a pointer to an integer array. The size of this array (which will always be 2 for [maximum m