python3 two pointer
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n    O(NlogN)\n\n- Space complexity:\n    O(N)\n# Code\n```\nclass Solution:\n    def getStrongest(self, arr: List[int], k: int) -> List[int]:\n        arr.sort()\n        mid = arr[(len(arr)-1)//2]\n        ans = []\n        l ,r = 0, len(arr)-1\n        while(l <= r):\n            if abs(arr[l] - mid) > abs(arr[r]-mid)  :\n                ans.append(arr[l])\n                l+=1\n            else:\n                ans.append(arr[r])\n                r-=1\n        return ans[:k]\n```
['Array', 'Two Pointers', 'Sorting', 'Python3']