Skip to main content

Find the Runner-Up Score! Hackerrank solution in Python 3

num=int(input())
l1=[]
element=input()
l1=element.split()
t=max(l1)
count=0
for i in range(0,num):
if t==l1[i]:
count=count+1
l1.sort()
if count==1:
print(l1[num-2])
else:
print(l1[num-3])

Comments

Popular posts from this blog

Breaking the Records Hackerrank solution in C

#include< stdio.h > int main() { int n,i,a[ 1000 ],x= 0 ,mn= 0 ; scanf( "%d" ,&n); for (i= 0 ;i<n;i++) { scanf( "%d" ,&a[i]); } int min=a[ 0 ],max=a[ 0 ]; for (i= 0 ;i<n;i++) { if (min>a[i]) { min=a[i]; mn++; } } for (i= 0 ;i<n;i++) { if (max<a[i]) { max=a[i]; x++; } } printf( "%d %d" ,x,mn); return 0 ; }