Leetcode 3371. Identify the Largest Outlier in an Array

Given an integer array where exactly n-2 elements are "special", one of the other two elements equals the sum of those special elements and the remaining one is an outlier, return the largest value that could serve as that outlier. Equivalently, find the largest element x for which there exists a distinct element s such that the sum of the array excluding x equals s.