Number of Employees Who Met the Target - Complete Solution Guide

Number of Employees Who Met the Target is LeetCode problem 2798, a Easy level challenge. This complete guide provides step-by-step explanations, multiple solution approaches, and optimized code in python3, java, cpp, c.

Problem Statement

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

Detailed Explanation

The problem asks you to count the number of employees who have worked at least a specified number of hours. The input is an array `hours`, where `hours[i]` represents the number of hours worked by employee `i`, and an integer `target` representing the minimum required hours. The output is a single integer: the count of employees who met or exceeded the `target` hours.

Solution Approach

The provided solution uses a straightforward iterative approach. It iterates through the `hours` array. For each employee's hours, it checks if the hours are greater than or equal to the `target`. If so, a counter (`count`) is incremented. Finally, the counter, representing the number of employees who met the target, is returned.

Step-by-Step Algorithm

1. Step 1: Initialize a counter variable `count` to 0.
2. Step 2: Iterate through the `hours` array using a loop.
3. Step 3: For each element `hour` in the `hours` array, compare `hour` with `target`.
4. Step 4: If `hour` is greater than or equal to `target`, increment `count`.
5. Step 5: After iterating through all elements, return the value of `count`.

Key Insights

• Insight 1: The problem is a simple iteration and comparison task. No sophisticated algorithms or data structures are necessary.
• Insight 2: A single loop is sufficient to iterate through the `hours` array and check each employee's hours against the `target`.
• Insight 3: The problem is easily solvable with a linear time complexity solution. There's no need for optimization beyond simple iteration.

Complexity Analysis

Time Complexity: O(n)

Space Complexity: O(1)

Topics

This problem involves: Array.

Companies

Asked at: tcs.