FilesExpand file tree

 master

/

third_largest_element.py

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

54 lines (41 loc) · 1.33 KB

 master

/

third_largest_element.py

Top

File metadata and controls

• Code
• Blame

54 lines (41 loc) · 1.33 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

""""

Third largest element

Given an array of distinct elements. Find the third largest element in it.

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case is N, size of the array. The second line of each test case contains N space separated values of the array a[].

Output:

Print the third largest element of the array. If the array has less than 3 elements print -1.

Your Task:

Complete the function thirdLargest() which takes the array a[] and the size of the array, n, as input parameters and returns the third largest element in the array. It return -1 if there are less than 3 elements in the given array.

Expected Time Complexity: O(N)

Expected Auxiliary Space: O(1)

Constraints:

1 ≤ T ≤ 100

1 ≤ N ≤ 105

1 ≤ A[i] ≤ 105

Example:

Sample Input:

2

5

2 4 1 3 5

2

10 2

Sample Output:

3

-1

Explanation:

Test Case 1: Largest number is 5, followed by 4 and then 3. Hence, the answer is 3.

Test Case 2: Since there are less than 3 numbers, output is -1.

"""

def thirdLargest(arr, n):

# code here

if n >= 3:

return sorted(arr)[-3]

else:

return -1

if __name__ == '__main__':

t = int(input())

for i in range(t):

n = int(input())

arr = list(map(int, input().split()))

print(thirdLargest(arr, n))