Skip to content

Practice Identify the Largest Outlier in an Array

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#3371
LeetCode Problem

Identify the Largest Outlier in an Array

Problem Statement

You are given an integer array nums. This array contains n elements, where exactly n - 2 elements are special numbers. One of the remaining two elements is the sum of these special numbers, and the other is an outlier. An outlier is defined as a number that is neither one of the original special numbers nor the element representing the sum of those numbers. Note that special numbers, the sum element, and the outlier must have distinct indices, but may share the same value. Return the largest potential outlier in nums.

Source: Identify the Largest Outlier in an Array on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [2,3,5,10]
Output
10

# Example 2

Input
nums = [-2,-1,-3,-6,4]
Output
4

# Example 3

Input
nums = [1,1,1,1,1,5,5]
Output
5

Constraints

3 <= nums.length <= 10^5
-1000 <= nums[i] <= 1000
The input is generated such that at least one potential outlier exists in nums.

Related LeetCode Problems

Practice more problems similar to Identify the Largest Outlier in an Array.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.