Challenge: Finding the Top 3 Hardest-Working Employees
Taak
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.
Oplossing
Was alles duidelijk?
Bedankt voor je feedback!
Sectie 1. Hoofdstuk 25
single
Vraag AI
Vraag AI
Vraag wat u wilt of probeer een van de voorgestelde vragen om onze chat te starten.
Geweldig!
Completion tarief verbeterd naar 2.33
Challenge: Finding the Top 3 Hardest-Working Employees
Veeg om het menu te tonen
Taak
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.
Oplossing
Was alles duidelijk?
Bedankt voor je feedback!
Sectie 1. Hoofdstuk 25
single