Challenge: Finding the Top 3 Hardest-Working Employees
Uppgift
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.
Lösning
Var allt tydligt?
Tack för dina kommentarer!
Avsnitt 1. Kapitel 25
single
Fråga AI
Fråga AI
Fråga vad du vill eller prova någon av de föreslagna frågorna för att starta vårt samtal
Fantastiskt!
Completion betyg förbättrat till 2.33
Challenge: Finding the Top 3 Hardest-Working Employees
Svep för att visa menyn
Uppgift
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.
Lösning
Var allt tydligt?
Tack för dina kommentarer!
Avsnitt 1. Kapitel 25
single