< Summary

Information
Class: LeetCode.Algorithms.RabbitsInForest.RabbitsInForestFrequencyArray
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RabbitsInForest\RabbitsInForestFrequencyArray.cs
Line coverage
100%
Covered lines: 18
Uncovered lines: 0
Coverable lines: 18
Total lines: 49
Line coverage: 100%
Branch coverage
100%
Covered branches: 6
Total branches: 6
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
NumRabbits(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RabbitsInForest\RabbitsInForestFrequencyArray.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 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.RabbitsInForest;
 13
 14/// <inheritdoc />
 15public class RabbitsInForestFrequencyArray : IRabbitsInForest
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="answers"></param>
 22    /// <returns></returns>
 23    public int NumRabbits(int[] answers)
 224    {
 225        var frequencyArray = new int[1000];
 26
 1827        foreach (var answer in answers)
 628        {
 629            frequencyArray[answer]++;
 630        }
 31
 232        var rabbits = 0;
 33
 400434        for (var i = 0; i < frequencyArray.Length; i++)
 200035        {
 200036            if (frequencyArray[i] == 0)
 199737            {
 199738                continue;
 39            }
 40
 341            var groupSize = i + 1;
 342            var groups = (frequencyArray[i] + groupSize - 1) / groupSize;
 43
 344            rabbits += groups * groupSize;
 345        }
 46
 247        return rabbits;
 248    }
 49}

Methods/Properties

NumRabbits(System.Int32[])