Easy py sol :)
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def getLargestOutlier(self, nums: List[int]) -> int:
        tot = 0
        dic = {}

        for i in range(len(nums)):
            tot += nums[i]
            if nums[i] not in dic:
                dic[nums[i]] = 1
            else:
                dic[nums[i]] += 1

        jvrc = float('-inf')
        print(tot)

        for i in range(len(nums)):
            temp = nums[i]+nums[i]
            if tot-temp in dic:
                if ((tot-temp)!=nums[i]):
                    jvrc = max(jvrc, (tot-temp))
                elif ((tot-temp)==nums[i] and dic[tot-temp] > 1):
                    jvrc = max(jvrc, (tot-temp))
                    
        return jvrc                   
        
        
```
['Python3']