Is Number of Employees Who Met the Target easy or hard?

Number of Employees Who Met the Target is categorized as an Easy problem. It focuses on basic array traversal and conditional checks, making it suitable for beginners practicing simple counting patterns in algorithms.

Number of Employees Who Met the Target Python/Java solution

Both Python and Java implementations follow the same idea: iterate through the array and count values greater than or equal to the target. Python may also use a filter expression, while Java typically uses a loop with a counter variable. Both approaches run in O(n) time.

How to solve Number of Employees Who Met the Target in O(n)?

Iterate through the hours array and compare each value with the target. Maintain a counter that increments whenever hours[i] >= target. After scanning the entire array, return the counter. This requires one linear pass and constant extra memory.

What is the best approach for Number of Employees Who Met the Target?

The best approach is a single-pass iterative count. Traverse the hours array and increment a counter whenever hours[i] >= target. This solution runs in O(n) time and O(1) space, which is optimal because every element must be inspected at least once.

Is Number of Employees Who Met the Target asked at Google/Amazon/Meta?

Problems of this style frequently appear in screening rounds at large tech companies because they test basic array traversal and conditional logic. While the exact problem may not always appear, similar counting and filtering array problems are common in interviews at companies like Amazon and Google.

What data structure is used in Number of Employees Who Met the Target?

The primary data structure is an array (or list). The algorithm simply scans the array and counts elements that satisfy a condition, so no additional structures like hash maps or stacks are required.

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

The time complexity is O(n), where n is the number of employees in the hours array. Each element is checked exactly once against the target value. The optimal iterative solution also uses O(1) additional space.

Description Hints 1 Solution Video 3:30

2798. Number of Employees Who Met the Target

Easy87.7% acceptance2 companies

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.

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

You are given a 0-indexed array of non-negative integers hours of length n and a non-negative integer target.

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

Example 1:

Input: hours = [0,1,2,3,4], target = 2
Output: 3
Explanation: The company wants each employee to work for at least 2 hours.
- Employee 0 worked for 0 hours and didn't meet the target.
- Employee 1 worked for 1 hours and didn't meet the target.
- Employee 2 worked for 2 hours and met the target.
- Employee 3 worked for 3 hours and met the target.
- Employee 4 worked for 4 hours and met the target.
There are 3 employees who met the target.

Example 2:

Input: hours = [5,1,4,2,2], target = 6
Output: 0
Explanation: The company wants each employee to work for at least 6 hours.
There are 0 employees who met the target.

Constraints:

1 <= n == hours.length <= 50
0 <= hours[i], target <= 10⁵

Asked at 2 companies

Amazon Microsoft

Topics

Array

Hints open one at a time

Hint 1

Iterate over the elements of array hours and check if the value is greater than or equal to target.

3:30

Still stuck?Read 3 approaches, or watch a walkthrough.

Open solution