Java_Fundamentals/SecondLargestinArray.java at main · devdeepak06/Java_Fundamentals · GitHub

37 lines (33 loc) · 1.3 KB

//You have been given a random integer array/list(ARR) of size N. You are required to find and return the second largest element present in the array/list.

//If N <= 1 or all the elements are same in the array/list then return -2147483648 or -2 ^ 31(It is the smallest value for the range of Integer).

//Input Format:

import java.util.Scanner;

public class SecondLargestinArray {

public static int secondLargest(int[] arr) {

int largest = Integer.MIN_VALUE;

int secondLargest = Integer.MIN_VALUE;

for (int i = 0; i < arr.length; i++) {

if (arr[i] > largest) {

secondLargest = largest;

largest = arr[i];

} else if (arr[i] > secondLargest && arr[i] != largest) {

secondLargest = arr[i];

}

return secondLargest;

}

public static void main(String[] args) {

try (Scanner s = new Scanner(System.in)) {

int t = s.nextInt();

while (t > 0) {

int n = s.nextInt();

int[] arr = new int[n];

for (int i = 0; i < n; i++) {

arr[i] = s.nextInt();

}

System.out.println(secondLargest(arr));

t--;

}

Java_Fundamentals/SecondLargestinArray.java at main · devdeepak06/Java_Fundamentals · GitHub

Expand file tree

Breadcrumbs

SecondLargestinArray.java

Latest commit

History

Breadcrumbs

SecondLargestinArray.java

File metadata and controls