Java|2 pointer | Easiest solution
\nclass Solution {\n    public int findMaxK(int[] nums) {\n        Arrays.sort(nums);\n        for (int i = 0; i < nums.length; i++) {\n            for (int j =
```\nclass Solution {\n    public int findMaxK(int[] nums) {\n        Arrays.sort(nums);\n        for (int i = 0; i < nums.length; i++) {\n            for (int j = nums.length-1; j>=0; j--) {\n                if(nums[i]+nums[j]==0)return nums[j];\n            }\n        }\n        return -1;\n    }\n}\n```
['Two Pointers', 'Java']