Py3 Easy Explained Sol
\n# Idea- Strongest value are willing to realy on boundary either side, and then inward with decreasing intesity.\n# Steps to solve\n# Sort, get median, and ass
```\n# Idea- Strongest value are willing to realy on boundary either side, and then inward with decreasing intesity.\n# Steps to solve\n# Sort, get median, and assign lastPointer, startPointer\n# compare lastPointer\'s element with startPointer\'s element, then add accordingly\n# only iterate loop for k, because elements in start and last with range of k, have Strongest value\n\n# OR\n# Explaination(hindi lang.)- https://www.youtube.com/watch?v=mvbTN2I3HxY\n\nclass Solution:\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        arr.sort()\n        lastPointer = -1\n        startPointer = 0\n        mInd = (len(arr)-1)//2\n        m = arr[mInd]\n        res = []\n        for i in range(k):\n            if abs(arr[lastPointer] - m) >= abs(arr[startPointer] - m):\n                res.append(arr[lastPointer])\n                lastPointer -= 1\n            else:\n                res.append(arr[startPointer])\n                startPointer += 1\n        return res\n\n```
['Sorting', 'Python', 'Python3']