Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3371. Identify the Largest Outlier in an Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source