largest-positive-integer-that-exists-with-its-negative.cpp

// Time:  O(n)
// Space: O(n)

// hash table
class Solution {
public:
    int findMaxK(vector<int>& nums) {
        unordered_set<int> lookup(cbegin(nums), cend(nums));
        int result = -1;
        for (const auto& x : lookup) {
            if (x > result && lookup.count(-x)) {
                result = x;
            }
        }
        return result;
    }
};