Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.