Java Sort | HackerRank Solution

Hello coders, today we are going to solve Java Sort HackerRank Solution.

Java Sort


You are given a list of student information: ID, FirstName, and CGPA. Your task is to rearrange them according to their CGPA in decreasing order. If two student have the same CGPA, then arrange them according to their first name in alphabetical order. If those two students also have the same first name, then order them according to their ID. No two students have the same ID.

Hint : You can use comparators to sort a list of objects.

Input Format

The first line of input contains an integer N, representing the total number of students. The next N lines contains a list of student information in the following structure:



  • 2 <= N <= 1000
  • 0 <= ID <= 100000
  • 5 <= |Name| <= 30
  • 0 <= |CGPA| <= 4.00

The name contains only lowercase English letters. The ID contains only integer numbers without leading zeros. The CGPA will contain, at most, 2 digits after the decimal point.

Output Format

After rearranging the students according to the above rules, print the first name of each student on a separate line.

Sample Input

 33 Rumpa 3.68
 85 Ashis 3.85
 56 Samiha 3.75
 19 Samara 3.75
 22 Fahim 3.76

Sample Output


Solution – Java Sort

import java.util.*;

class Student{
	private int id;
	private String fname;
	private double cgpa;
	public Student(int id, String fname, double cgpa) {
		super(); = id;
		this.fname = fname;
		this.cgpa = cgpa;
	public int getId() {
		return id;
	public String getFname() {
		return fname;
	public double getCgpa() {
		return cgpa;

//Complete the code
public class Solution
	public static void main(String[] args){
		Scanner in = new Scanner(;
		int testCases = Integer.parseInt(in.nextLine());
		List<Student> studentList = new ArrayList<Student>();
			int id = in.nextInt();
			String fname =;
			double cgpa = in.nextDouble();
			Student st = new Student(id, fname, cgpa);
       Collections.sort(studentList,  Comparator.comparing(Student :: getCgpa).reversed().thenComparing(Student :: getFname).thenComparing(Student :: getId));
      	for(Student st: studentList){

Disclaimer: The above Problem ( Java Sort ) is generated by Hacker Rank but the Solution is Provided by CodingBroz. This tutorial is only for Educational and Learning Purpose.

Leave a Comment

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