Nested Lists – HackerRank | Solution| Full Explained

Nested Lists – HackerRank | Solution| Full Explained

Here I am going to share Nested Lists – HackerRank Solution with you. Hope you understand everything. visit the question: [Click Here]

to know about

Nested Lists [click here]

# marksheet and scorelist declartion
marksheet=[]
scorelist=[]

if __name__ == '__main__':

        for _ in range(int(input())):
                name = input()
                score = float(input())
                marksheet+=[[name,score]]
                scorelist+=[score]
        # extration of second most greated marks
        score_max = sorted(list(set(scorelist)))[1] 
        
        # here we are sorting the marksheet by the order n(name) and s(score).
        for n,s in sorted(marksheet):
             # if the 
             if s == score_max:
                    print(n)

if you don’t understand any parts of the program, comment in the comment box

2 Replies to “Nested Lists – HackerRank | Solution| Full Explained”

  1. I simply wanted to say thanks once more. I’m not certain the things I would’ve achieved in the absence of the entire suggestions discussed by you concerning that subject matter. It was actually a scary dilemma in my view, nevertheless witnessing your skilled way you resolved it took me to cry with joy. I’m just grateful for the support and trust you are aware of a great job that you’re doing teaching the others thru a site. Most likely you haven’t got to know any of us.

Leave a Reply

Your email address will not be published. Required fields are marked *