Two Pointer || Sorting || 93% T.C || 66% S.C || CPP
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:O(nlogn)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int findMaxK(vector<int>& nums) {\n        int i=0,j=nums.size()-1;\n        sort(nums.begin(),nums.end());                                                                                                                                                                                                                                                   \n        while(i<j){\n            int diff=nums[i]+nums[j];\n            if(diff>0) j--;\n            else if(diff<0) i++;\n            else return nums[j];\n        }\n        return -1;\n    }\n}; \n```
['C++']