Find the Second Largest ElementIn a small village, there's a yearly pumpkin festival where farmers compete to grow the largest pumpkins. This year, the village council wants to recognize not only the farmer with the largest pumpkin but also the one with the second largest. They have a list of pumpkin weights, and they need a program to determine the second largest pumpkin weight.Write a function that finds the second largest element in an array of integers representing pumpkin weights.Constraints:NAExample:Input:510 5 8 12 7Output:10Explanation:Input:5     ----------->Size of array10 5 8 12 7Output:10---> is the second largest element in the given array

Imagine a sports event where participants are ranked based on their performance, and medals are awarded to the best athletes. In this scenario, you have an array of athletes' performance scores and you want to identify the kth largest score among all the scores.ExampleInput:N = 5, scores = {3, 5, 1, 2, 4}k = 1Output:5Explanation: The 1st largest score in the provided scores {3, 5, 1, 2, 4} is 5.Input format :The first line of input consists of an integer N, representing the number of athletesThe second line consists of N space-separated integers, representing the athlete scores.The third line consists of an integer k.Output format :The output prints the kth largest score.Refer to the sample output for formatting specifications.Code constraints :1 ≤ N ≤ 201 ≤ scores ≤ 100Sample test cases :Input 1 :53 5 1 2 41Output 1 :5Input 2 :610 20 30 40 50 604Output 2 :30

Problem StatementAlex, a logistics manager, is responsible for handling various pieces of luggage. He needs to determine the weight distribution among these pieces and find the heaviest and lightest pieces, along with the weight difference between them. To accomplish this, he plans to create a simple program that takes as input the weights of various pieces of luggage and uses the linear search algorithm to search and identify the heaviest and lightest pieces, as well as calculate the weight difference between them.Write a program to help Alex accomplish this task.Input format :The first line of input consists of an integer N, representing the number of luggage.The second line consists of N space-separated integers, representing the weights of the luggage.Output format :The first line of output prints "Heaviest piece weight: ", followed by the weight of the heaviest piece.The second line prints "Lightest piece weight: ", followed by the weight of the lightest piece.The third line prints "Weight difference: ", followed by their weight difference.Refer to the sample output for formatting specifications.Code constraints :The test cases fall under the following constraints:1 ≤ N ≤ 101 ≤ weight of each piece ≤ 100Sample test cases :Input 1 :510 15 20 25 30Output 1 :Heaviest piece weight: 30Lightest piece weight: 10Weight difference: 20Input 2 :870 65 80 75 60 55 50 45Output 2 :Heaviest piece weight: 80Lightest piece weight: 45Weight difference: 35

Given two arrays (arr1[], arr2[]) of integers, display the largest number in arr1, where that element should not be present in arr2. If the constraint is not satisfied return 0.Variable Constraints:Size of the array <= 5;Array data type = integer.Input:Size of array 1Elements of array 1Size of array 2Elements of array 2Output:Largest element in array 1

Find the maximum element from the given array of integers.

largest and smallest element in Binary Search TreeGiven a binary search tree find the kth largest and smallest element in Binary Search Tree.Input :First line of input contains number of elements in an arraaySecond line of input contains an array of elementsThird line of input contains the value of 'K' Output : First line of output contains the largest element in an arraySecond line of output contains the smallest element in an array.