I found this code on this site to find the second largest number:
def second_largest(numbers): m1, m2 = None, None for x in numbers: if x >
Or just use heapq:
import heapq def second_largest(numbers): return heapq.nsmallest(2, numbers)[-1] second_largest([1, 2, 3, 4]) # Output: 2