🔥 Javascript Solution - Clean Logic
\nfunction getStrongest(A, k) {\n    // get abs methods\n    const { abs, floor } = Math\n    \n    // sort first\n    A.sort((a, b) => a - b)\n    \n    // get
```\nfunction getStrongest(A, k) {\n    // get abs methods\n    const { abs, floor } = Math\n    \n    // sort first\n    A.sort((a, b) => a - b)\n    \n    // get middle\n    const m = A[floor((A.length-1) / 2)]\n    \n    // soring by middle\n    A.sort((a, b) => abs(a - m) - abs(b - m))\n    \n    // reverse\n    A.reverse()\n    \n    // Strongest Values by k\n    return A.slice(0, k)\n}\n```
['JavaScript']