Problem Journey

Second Largest Element

Easy | Array | Solved: Feb 15, 2026 | Source: Practice

Complexity Analysis

Time Complexity: O(n)

Space Complexity: O(1)

Problem Description

Given an array of integers, return the second largest distinct element.

Approach

Track the largest and second largest values while scanning the array once.

Solution

class Solution {
    public int secondLargest(int[] nums) {
        int largest = Integer.MIN_VALUE;
        int secondLargest = Integer.MIN_VALUE;

        for (int n : nums) {
            if (n > largest) {
                secondLargest = largest;
                largest = n;
            } else if (n != largest && n > secondLargest) {
                secondLargest = n;
            }
        }

        return secondLargest;
    }
}