🔥 🔥 🔥 Simple solution in Python 🔥 🔥 🔥
Intuition\n- Add all the existing nums in the set and search for the maxK which has -k and k.\n\n# Approach\n1. Add all the nums in the set.\n2. Assign maxNum a
# Intuition\n- Add all the existing nums in the set and search for the maxK which has -k and k.\n\n# Approach\n1. Add all the nums in the set.\n2. Assign maxNum as -1\n2. Iterate over the nums array and check if `-num` exists in the set, if so update the `maxNum` to: maxNum = max(maxNum, abs(num))\n3. Return the `maxNum`\n\n# Complexity\n- Time complexity:\nO(N)\n- Space complexity:\nO(N)\n\n# Code\n```\nclass Solution:\n    def findMaxK(self, nums: List[int]) -> int:\n        # nums = [-1, 2, -3, 3]\n        mySet = set(nums)\n        maxNum = -1\n\n        for num in nums:\n            if -num in mySet:\n                maxNum = max(maxNum, abs(num))\n                \n        return maxNum\n```
['Python3']