Algorithm

Problem Name: Python - Find the Runner-Up Score!

Problem Link: https://www.hackerrank.com/challenges/find-second-maximum-number-in-a-list/problem?isFullScreen=true

In this HackerRank Functions in PYTHON problem solution,

Given the participants' score sheet for your University Sports Day, you are required to find the runner-up score. You are given n 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,3,6,6,5]  The maximum score is 6, second maximum is 5 Hence, we print 5 as the runner-up score.

 

 

 

Code Examples

#1 Code Example with Python Programming

Code - Python Programming


if __name__ == '__main__':
    n = int(input())
    arr = map(int, input().split())
    
    arr =sorted(set(arr))
    print(arr[-2])
Copy The Code & Try With Live Editor
Advertisements

Demonstration

Previous
[Solved] List Comprehensions in PYTHON solution in Hackerrank
Next
[Solved] Nested Lists in PYTHON solution in Hackerrank