✅C++||✅Intuitive HashMap ||✅Short Code
\nint findMaxK(vector<int>& nums) {\n        \n        map<int,int> mp ;\n        for( auto it : nums ) mp[it]++;\n        \n        int ans = INT_MIN ;\n      
```\nint findMaxK(vector<int>& nums) {\n        \n        map<int,int> mp ;\n        for( auto it : nums ) mp[it]++;\n        \n        int ans = INT_MIN ;\n        bool gotAnsr = false ;\n        \n        for( int i=0 ; i<nums.size() ; i++ ){\n            \n            if( nums[i] > 0 ) {\n                if( mp.find( 0-nums[i] ) != mp.end() ){\n                    \n                    ans = max( ans, nums[i] );\n                    gotAnsr = true ;\n                }\n            }\n        }\n        \n        if( gotAnsr ) return ans ;\n        return -1 ;\n    }\n```
[]