Given an integer array arr and an integer k.

A value arr[i] is considered stronger than a value arr[j] if:

• $|$arr[i] - m$| > |$arr[j] - m$|$, or

• $|$arr[i] - m$| = |$arr[j] - m$|$ and arr[i] $>$ arr[j]

where m is the median of arr.

The median of an array of length n is the value at index $(n - 1) / 2$ after sorting the array in non decreasing order, using $0$ based indexing.

Return an array of the k strongest values in arr. The result can be returned in any order.

Constraints:

• $1 \leq$ arr.length $\leq 10^5$

• $-10^5 \leq$ arr[i] $\leq 10^5$

• $1 \leq$ k $\leq$ arr.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.