Hello Programmers, In this post, you will know how to solve the **Nested Lists in Python HackerRank Solution**. This problem is a part of the **HackerRank Python Programming** Series.

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.

## Nested Lists in Python HackerRank Solution

### 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**

The ordered list of scores is , so the second lowest score is . There are two students with that score: . Ordered alphabetically, the names are printed as:

alpha beta

**Input Format**

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

The subsequent lines describe each student over 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 Physics; if there are multiple students, order their names alphabetically and print each one on a new line.

**Sample Input 0**

5 Harry 37.21 Berry 37.21 Tina 37.2 Akriti 41 Harsh 39

**Sample Output 0**

Berry Harry

**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.

### Nested Lists in Python Hacker Rank Solution

if __name__ == '__main__': students = [] for _ in range(int(input())): name = input() score = float(input()) students.append([name,score]) x = 99999 for i in range(len(students)): if x > float(students[i][1]): x = float(students[i][1]) y = 999999 for i in range(len(students)): if float(students[i][1]) > float(x) and y > float(students[i][1]): y = float(students[i][1]) runner = [] for i in range(len(students)): if float(students[i][1]) == float(y): runner.append(students[i][0]) runner = sorted(runner) for i in range(len(runner)): print(runner[i])

**Disclaimer: **The above Problem **(Nested Lists in Python)** is generated by **Hackerrank** but the Solution is Provided by **BrokenProgrammers**. This tutorial is only for Educational and Learning purposes.

**Next: **Find the Runner-Up Score! in Python HackerRank Solution