< Summary

Information
Class: LeetCode.Algorithms.FindMinimumOperationsToMakeAllElementsDivisibleByThree.FindMinimumOperationsToMakeAllElementsDivisibleByThreeIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindMinimumOperationsToMakeAllElementsDivisibleByThree\FindMinimumOperationsToMakeAllElementsDivisibleByThreeIterative.cs
Line coverage
100%
Covered lines: 3
Uncovered lines: 0
Coverable lines: 3
Total lines: 28
Line coverage: 100%
Branch coverage
N/A
Covered branches: 0
Total branches: 0
Branch coverage: N/A
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MinimumOperations(...)100%11100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindMinimumOperationsToMakeAllElementsDivisibleByThree\FindMinimumOperationsToMakeAllElementsDivisibleByThreeIterative.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.FindMinimumOperationsToMakeAllElementsDivisibleByThree;
 13
 14/// <inheritdoc />
 15public class FindMinimumOperationsToMakeAllElementsDivisibleByThreeIterative :
 16    IFindMinimumOperationsToMakeAllElementsDivisibleByThree
 17{
 18    /// <summary>
 19    ///     Time complexity - O(n)
 20    ///     Space complexity - O(1)
 21    /// </summary>
 22    /// <param name="nums"></param>
 23    /// <returns></returns>
 24    public int MinimumOperations(int[] nums)
 225    {
 1626        return nums.Select(num => num % 3).Count(remainder => remainder != 0);
 227    }
 28}