How hard is LeetCode 2798. Number of Employees Who Met the Target?

LeetCode 2798. Number of Employees Who Met the Target is rated Easy on LeetCode.

What is the time complexity of LeetCode 2798. Number of Employees Who Met the Target?

The Python solution on this page runs in O(n), where n is the length of the array hours.

The Python solution on this page uses O(1) auxiliary space.

LeetCode 2798. Number of Employees Who Met the Target is tagged Array on LeetCode.

EasyArray

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

Python

class Solution:
    def numberOfEmployeesWhoMetTarget(self, hours: List[int], target: int) -> int:
        return sum(x >= target for x in hours)

Measure	Complexity
Time	O(n), where n is the length of the array hours
Space	O(1) auxiliary

How hard is LeetCode 2798. Number of Employees Who Met the Target?: LeetCode 2798. Number of Employees Who Met the Target is rated Easy on LeetCode.
What is the time complexity of LeetCode 2798. Number of Employees Who Met the Target?: The Python solution on this page runs in O(n), where n is the length of the array hours.
What is the space complexity of LeetCode 2798. Number of Employees Who Met the Target?: The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 2798. Number of Employees Who Met the Target cover?: LeetCode 2798. Number of Employees Who Met the Target is tagged Array on LeetCode.