< Summary

Information
Class: LeetCode.Algorithms.NumberOfEmployeesWhoMetTheTarget.NumberOfEmployeesWhoMetTheTargetCounting
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NumberOfEmployeesWhoMetTheTarget\NumberOfEmployeesWhoMetTheTargetCounting.cs
Line coverage
100%
Covered lines: 12
Uncovered lines: 0
Coverable lines: 12
Total lines: 41
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
NumberOfEmployeesWhoMetTarget(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\NumberOfEmployeesWhoMetTheTarget\NumberOfEmployeesWhoMetTheTargetCounting.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.NumberOfEmployeesWhoMetTheTarget;
 13
 14public sealed class NumberOfEmployeesWhoMetTheTargetCounting : INumberOfEmployeesWhoMetTheTarget
 15{
 16    /// <summary>
 17    ///     Time complexity - O(n)
 18    ///     Space complexity - O(1)
 19    /// </summary>
 20    /// <param name="hours"></param>
 21    /// <param name="target"></param>
 22    /// <returns></returns>
 23    public int NumberOfEmployeesWhoMetTarget(int[] hours, int target)
 1124    {
 1125        var result = 0;
 26
 8427        for (var i = 0; i < hours.Length; i++)
 3128        {
 3129            var hour = hours[i];
 30
 3131            if (hour < target)
 1232            {
 1233                continue;
 34            }
 35
 1936            result++;
 1937        }
 38
 1139        return result;
 1140    }
 41}