Hello Programmers, In this post, you will know how to solve the Find the Runner-Up Score! in Python HackerRank Solution. This problem is a part of the HackerRank Python Programming Series.
One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.
Find the Runner-Up Score! in Python HackerRank Solution
Problem
Given the participants’ score sheet for your University Sports Day, you are required to find the runner-up score. You are given scores. Store them in a list and find the score of the runner-up.
Input Format
The first line contains n. The second line contains an array A[] of n integers each separated by a space.
Constraints :
- 2 <= n <= 10
- -100 <= A[i] <= 100
Output Format
Print the runner-up score.
Sample Input 0
5 2 3 6 6 5
Sample Output 0
5
Explanation 0
Given list is [2,3,6,6,5] . The maximum score is , second maximum is . Hence, we print as the runner-up score.
Find the Runner-Up Score! in Python Hacker Rank Solution
if __name__ == '__main__': n = int(input()) arr = map(int, input().split()) print(sorted(list(set(arr)))[-2])
Disclaimer: The above Problem (Find the Runner-Up Score! in Python) is generated by Hackerrank but the Solution is Provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.