✅C++ | ✅2 pointers approach | ✅Easy Approach
Please upvote if you find this solution helpful :)\n\nclass Solution \n{\npublic:\n    int findMaxK(vector<int>& nums) \n    {\n        sort(nums.begin(), nums.
**Please upvote if you find this solution helpful :)**\n```\nclass Solution \n{\npublic:\n    int findMaxK(vector<int>& nums) \n    {\n        sort(nums.begin(), nums.end());\n        int low=0, high=nums.size()-1;\n        \n        while(low < high)\n        {\n            if((nums[low] + nums[high]) == 0)\n            {\n                return  nums[high];\n            }\n            \n            else if((nums[low] + nums[high]) < 0)\n                low++;\n            \n            else high--;\n        }\n        return -1;\n    }\n};\n```
['Two Pointers', 'C', 'C++']