C++ Array
Bruteforce Approach \n\n int findMaxK(vector<int>& nums) {\n        int maxi = -1;\n        for (int i = 0; i < nums.size(); i++)\n        {\n            for (i
Bruteforce Approach \n```\n int findMaxK(vector<int>& nums) {\n        int maxi = -1;\n        for (int i = 0; i < nums.size(); i++)\n        {\n            for (int j = 0; j < nums.size(); j++)\n            {\n                if (nums[i] == nums[j]*-1)\n                    maxi = max(nums[i], maxi);\n            }\n        }\n        return maxi;\n    }\n```
['C', 'C++']