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
workers
in ascending order by the number ofhoursWorked
using thecomparingInt()
method. - Reverse the list of
workers
to make it descending by the number ofhoursWorked
using thereversed()
method. - Select the top three workers with the highest
hoursWorked
using thelimit()
method. - Print each of these three workers to the console.
Oplossing
solution
Was alles duidelijk?
Bedankt voor je feedback!
Sectie 2. Hoofdstuk 10