#9 : Find the Runner-Up Score | Hackerrank Python Solutions

Thanks if u r Watching us....
#Python #Dev19 #HackerankSOlutions #C #C++ #Java #Python
Please Subscribe Us ....

[ameyadvirkar]

print (sorted(set(arr))[-2]) #EXPLANATION: here array is converted into set because sets cannot have duplicate values so if any number is repeating it is eliminated {2, 3, 6, 5}, then the set is sorted because sets are unordered {2, 3, 5, 6}, finally element at index -2 which is 5 is printed.

[Mohsin_Ali]

Array ko list me bhi convert karna hoga uske bina ni ho raha
arr =list(map(int, input().split()))

[deepdapp]

It works.

if __name__ == '__main__':
n = int(input())
arr = map(int, input().split())
new_arr = [x for x in arr]
a = max(new_arr)
count = 0
for i in new_arr:
if i == a:
count +=1
for j in range(count):
new_arr.remove(a)
print(max(new_arr))

[siddheshsutar]

m=max(arr)
while m in arr:
arr.remove(m)
print(max(arr))
for python 3
i hope it helps

[Cherry_rhyme_]

n=int(input("enter"))
a=[]
for i in range(n):
b=int(input("enter"))
a.append(b)
print(a)
f=a[0]
s=a[1]
for i in a:
if(i>f):
f=i
print(f)
for j in a:
and j<f):

print("second largest number", s)

[anupadhikari]

Try this one guys:
print(sorted(set(arr), reverse = True)[1])

Hope it helps.
Thanks

[srishtimishra]

Thanks bro...Ur teaching style is awesome... I understood it perfectly... 🙏

[dhipikaach]

l=list(arr)
l=list(dict.fromkeys(l))
l. sort(reverse=True)
Print(l[1])

[Bhongaon]

if __name__ == '__main__':
n = int(input())
arr = list(map(int, input().split()))
print(max([i for i in arr if i < max(arr)]))

[oak]

Thank you! This was very helpful for me

[PratapOO]

Why are we using predefined methods to solve this?

[BryanJJH]

if __name__ == '__main__':
n = int(input("Tamaño: "))
arr = sorted(map(int, input("Elementos: ").split()))
mayor = max(arr)
i = -1
subcampeon = 0
while i < n:
if arr[i] < mayor:
subcampeon = i
break
i -= 1
print(arr[subcampeon])

works, but is this correct? I think I cheated

[jaganmohan]

if __name__ == '__main__':
n = int(input())
arr = map(int, input().split())
arr = list(arr)
arr.sort(reverse=True)
m = max(arr)
for i in arr:
if i!=m:
r=i
break

print(r)

[sainath]

Thanks bro got it
Bro this code works fine in python 2
and what need to change in this code to work in python 3

[mmmk]

x = max(arr)
arr.remove(x)
print(max(arr))

[SoninHachinMedee]

if __name__ == '__main__':
n = int(input())
arr = list(map(int, input().split()))

m = max(arr)

c = arr.count(m)

for i in range(c):
arr.remove(m)

print(max(arr))

[kushagratiwari]

if __name__ == '__main__':
n = int(input())
arr = map(int, input().split())

lst = list(arr)
lst1 = list(set(lst))
lst1.sort()
print(lst1[-2])

this was my logic

[aaliyanmalik]

Try this one:

x = max(arr)
c = arr.count(x)
for i in range(c):
arr.remove(x)

print(max(arr))

[jayeshyedge]

Sir talk in Hindi. We understand Hindi.

[wenchunchang]

if __name__ == '__main__':
n = int(input())
arr = list(map(int, input().split()))

m=max(arr)
c=arr.count(m)

for i in range(c):
arr.remove(m)
print(max(arr))