# Java program to find second largest number in an array

If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions.

In this post, we will see how to find the second largest number in an array.

## Problem :

Given an unsorted array, you need to find the second largest element in the array in `o(n)` time complexity.
For example:

int[] arr1={7,5,6,1,4,2};
Second largest element in the array : 6

## Solution:

You can sort the array and then return second last element in the array but it will be done in o(nlogn)  time,

#### Algorithm:

• Initialize highest and secondHighest with minimum possible value.
• Iterate over array.
• If current element is greater than highest
• Assign secondHighest = highest
• Assign highest = currentElement
• Else if current element is greater than secondHighest
• Assign secondHighest =current element.

### Java Program to find second largest number in array:

Create the main java class named `FindSecondLargestMain.java`
When you run above program, you will get below output:

Second largest element in the array : 6

That’s all about how to find second largest number in an array.

import_contacts

import_contacts

## Related Posts

• 04 June

### Search for a range Leetcode – Find first and last position of element in sorted array

Table of ContentsApproach 1 (Using Linear Search)Approach 2 (Using Modified Binary Search-Optimal) In this article, we will look into an interesting problem asked in Coding Interviews related to Searching Algorithms. The problem is: Given a Sorted Array, we need to find the first and last position of an element in Sorted array. This problem is […]

• 28 March

### Sort an array of 0s, 1s and 2s

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to sort an array of 0s, 1s and 2s.We have already seen a post on sort 0s and 1s in an array. Problem Given an array containing zeroes, […]

• 04 March

### Check if it is possible to reach end of given Array by Jumping

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. ﻿ ﻿ Problem Given an array with positive integers as elements indicating the maximum length of a jump which can be made from any position in the array. Check if it is possible to have […]

• 17 February

### Check if Array Elements are Consecutive

Table of ContentsProblemSolutionProgram to check if Array Elements are Consecutive If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see how to check if array elements are consecutive. Problem Given an array, we need to check if array contains […]

• 01 November

### Find the local minima in array

Table of ContentsProblemSolutionNaive approachEfficient approach If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to find the local minima in the array. Problem An element is local minima if it is less than its neighbors. int [] arr = {10, […]

• 22 October

### Sliding Window Maximum in java

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see about Sliding Window Maximum in java Problem Given an Array of integers and an Integer k, Find the maximum element of from all the contiguous subarrays of size K. […]

1. Smitha Byrapatna says:

I love your blog. Thanks a ton to you. One of the best website to get ready for interviews.

2. Sangamesh says:

Hi, this code will fail if an array contains duplicate which is also happened to be largest element.
Example: arr[] = {7, 8, 8, 1, 4, 2}

1. Arpit Mandliya says:

Missed the edge case!! Thank you for bringing it up. Fixed it.

3. Sangamesh says:

If we change else id condition code works fine all cases,
else if (array[i] > secondHighest && array[i] != highest){
secondHighest = array[i];
}

## Subscribe to our newletter

Get quality tutorials to your inbox. Subscribe now.