My first crashout :)
i might swerve bend that corner woaaaooaaahCode
i might swerve bend that corner woaaaooaaah

# Code
```python3 []
class Solution:
    def getLargestOutlier(self, nums: List[int]) -> int:
        # (n-2) numbers are summed
        # (1) number is the sum of (n-2)
        # (1) number is an outlier

        # at every n in nums
            # treat n as the outlier
            # sum nums without n / 2 == candidate sum of (n-2), call potentialSum
            # if potentialSum in nums:
                # n is outlier if max outlier seen so far
    
        numsSum = sum(nums)
        numsMap = defaultdict(list)
        # ansMap = {"outlier":float('-inf'), "diff":float('-inf')}
        largestOutlier = float('-inf')
        # print(f"SUM IS: {numsSum}")
        for i, n in enumerate(nums):
            numsMap[n].append(i)
        # print(numsMap)

        for i in range(len(nums)):
            candidateOutlier = nums[i]
            potentialSum = numsSum - nums[i]
            potentialNum = (potentialSum / 2) # sum of special nums
            curDiff = abs(candidateOutlier - potentialNum) 
            # print(f"{candidateOutlier}, {curDiff}")
            if potentialNum in numsMap and i != numsMap[potentialNum][0]:
            # if (len(numsMap[candidateOutlier]) == 1 and candidateOutlier != potentialNum) or (candidateOutlier == potentialNum and len(numsMap[candidateOutlier]) == 2):
                # print(f"Passed condition: {candidateOutlier}, {curDiff}")
                # ansMap["outlier"] = candidateOutlier
                # ansMap["diff"] = curDiff
                largestOutlier = max(largestOutlier, candidateOutlier)
        
        return largestOutlier
        # return ansMap["outlier"]    
        # 5
        # 10
        # 5


```
['Python3']