Challenge: Finding the Top 3 Hardest-Working Employees
Tarefa
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.
Solução
Tudo estava claro?
Obrigado pelo seu feedback!
Seção 1. Capítulo 25
single
Pergunte à IA
Pergunte à IA
Pergunte o que quiser ou experimente uma das perguntas sugeridas para iniciar nosso bate-papo
Incrível!
Completion taxa melhorada para 2.33
Challenge: Finding the Top 3 Hardest-Working Employees
Deslize para mostrar o menu
Tarefa
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.
Solução
Tudo estava claro?
Obrigado pelo seu feedback!
Seção 1. Capítulo 25
single