Find K Closest Elements|| 2-pointer approach || Easy-understanding
\n    int n=arr.size();\n        vector<int>ans;\n        int start=0,end=n-1;\n        while((end-start)>=k){\n            if(abs(arr[start]-x) > abs(arr[end]-
```\n    int n=arr.size();\n        vector<int>ans;\n        int start=0,end=n-1;\n        while((end-start)>=k){\n            if(abs(arr[start]-x) > abs(arr[end]-x)){\n                start++;\n            }\n            else{\n                end--;\n            }\n        } \n        for(int i=start;i<=end;i++){\n            ans.push_back(arr[i]);\n        }\n        return ans;\n\t\t```
['Two Pointers', 'C']