Challenge: Finding the Top 3 Hardest-Working Employees
Tâche
Swipe to start coding
Several employees work at the factory, and we need to identify the three hardest-working employees based on the number of hours worked.
- Sort the list of
workersin ascending order by the number ofhoursWorkedusing thecomparingInt()method. - Reverse the list of
workersto make it descending by the number ofhoursWorkedusing thereversed()method. - Select the top three workers with the highest
hoursWorkedusing thelimit()method. - Print each of these three workers to the console.
Solution
Tout était clair ?
Merci pour vos commentaires !
Section 1. Chapitre 25
single
Demandez à l'IA
Demandez à l'IA
Posez n'importe quelle question ou essayez l'une des questions suggérées pour commencer notre discussion
Génial!
Completion taux amélioré à 2.33
Challenge: Finding the Top 3 Hardest-Working Employees
Glissez pour afficher le menu
Tâche
Swipe to start coding
Several employees work at the factory, and we need to identify the three hardest-working employees based on the number of hours worked.
- Sort the list of
workersin ascending order by the number ofhoursWorkedusing thecomparingInt()method. - Reverse the list of
workersto make it descending by the number ofhoursWorkedusing thereversed()method. - Select the top three workers with the highest
hoursWorkedusing thelimit()method. - Print each of these three workers to the console.
Solution
Tout était clair ?
Merci pour vos commentaires !
Section 1. Chapitre 25
single