Java O(N), 85ms solution
IntuitionJava O(N), 85ms solutionApproachComplexity

Time complexity:
O(N)


Space complexity:
O(N)

Code
# Intuition
Java O(N), 85ms solution

# Approach


# Complexity
- Time complexity:
O(N)

- Space complexity:
O(N)

# Code
```java []
class Solution {

    public int getLargestOutlier(int[] nums) {
        int i, sum = 0, outlier = Integer.MIN_VALUE, temp;
        HashMap<Integer, Integer> map = new HashMap<>();
        for (i = 0; i < nums.length; i++) {
            sum += nums[i];
            map.put(nums[i], map.getOrDefault(nums[i], 0) + 1);
        }
        
        for (i = 0; i < nums.length; i++) {
            temp = sum - nums[i];
// Need to verify num[i] is outlier and not special number 
            if (temp % 2 == 0 && map.containsKey(temp/2) && (temp/2 != nums[i] || map.get(temp/2) > 1)) { 
                outlier = Math.max(outlier, nums[i]);
            }
        }
        return outlier;
    }
}
```
['Java']