Nested List HackerRank Solution in Python

Problem

Given the names and grades for each student in a class of N students, store them in a nested list and print the name(s) of any student(s) having the second lowest grade.

Note: If there are multiple students with the second lowest grade, order their names alphabetically and print each name on a new line.

Example

records = [[“chi”, 20.0], [“beta”, 50.0], [“alpha”, 50.0]]

The ordered list of scores is [20.0, 50.0], so the second lowest score is 50.0. There are two students with that score: [“beta”, “alpha”]. Ordered alphabetically, the names are printed as:

alphabeta

Input Format

The first line contains an integer, N, the number of students.

The 2N subsequent lines describe each student over 2 lines.

– The first line contains a student’s name.
– The second line contains their grade.

Constraints

• 2 ≤ N ≤ 5
• There will always be one or more students having the second lowest grade.

Output Format

Print the name(s) of any student(s) having the second lowest grade in. If there are multiple students, order their names alphabetically and print each one on a new line.

Sample Input 0

5Harry37.21Berry37.21Tina37.2Akriti41Harsh39

Sample Output 0

BerryHarry

Explanation 0

There are 5 students in this class whose names and grades are assembled to build the following list:

python students = [[‘Harry’, 37.21], [‘Berry’, 37.21], [‘Tina’, 37.2], [‘Akriti’, 41], [‘Harsh’, 39]]

The lowest grade of 37.2 belongs to Tina. The second lowest grade of 37.21 belongs to both Harry and Berry, so we order their names alphabetically and print each name on a new line.

Solution to HackerRank Nested List in Python

In this problem, we are to print out the name of the student(s) that has/have the second lowest score and print them out on different pages in alphabetical order from the given inputs.

if __name__ == '__main__':    students = list()    for _ in range(int(input())):        name = input()        score = float(input())        student = [name, score]        students.append(student)    students.sort(key = lambda x: x[1])    second_stu = list()    for student in students:        if student[1] != students[0][1]:            second_stu.append(student)    second_least = sorted([sec[0] for sec in second_stu if sec[1] == second_stu[0][1]])    for names in second_least:        print(names)

Thanks for reading