There are $n$ employees in a company, indexed from $0$ to $n - 1$. Each employee $i$ has worked for hours[i] hours.

The company requires each employee to work at least target hours.

Return the total number of employees who worked at least target hours.

Constraints:

• $1 \leq n ==$ hours.length $\leq 50$

• $0 \leq$ hours[i], target $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.