Challenge: Finding the Top 3 Hardest-Working Employees
Task
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.
Solution
solution.java
Everything was clear?
Thanks for your feedback!
SectionΒ 2. ChapterΒ 10
single
Ask AI
Ask AI
Ask anything or try one of the suggested questions to begin our chat
Awesome!
Completion rate improved to 2.33
Challenge: Finding the Top 3 Hardest-Working Employees
Swipe to show menu
Task
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.
Solution
solution.java
Everything was clear?
Thanks for your feedback!
Awesome!
Completion rate improved to 2.33SectionΒ 2. ChapterΒ 10
single