O(n) solution...
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 []
from collections import Counter
class Solution:
    def getLargestOutlier(self, nums: List[int]) -> int:
        numshash = Counter(nums)
        total = sum(nums)
        maxans = float('-inf')
        for i in nums:
            target = (total - i)/2
            if target in numshash:
                if target == i:
                    if numshash[target] >= 2:
                        maxans = max(maxans, i)
                else:
                    maxans = max(maxans, i)


        return maxans
        

        
```
['Python3']