Javascript Sorting solution
\nvar getStrongest = function(arr, k) {\n    arr.sort(function(a,b){return a-b});\n\t//find median\n    var med = arr[Math.floor((arr.length-1)/2)];\n\t//sort u
```\nvar getStrongest = function(arr, k) {\n    arr.sort(function(a,b){return a-b});\n\t//find median\n    var med = arr[Math.floor((arr.length-1)/2)];\n\t//sort using median\n    arr.sort(function(a,b){return Math.abs(a-med) - Math.abs(b-med)});\n\t//reverse the array and slice for K strongest values\n    arr.reverse();\n    return arr.slice(0,k)\n};\n```
[]