< Summary

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

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MinOperations(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumOperationsToMakeArrayValuesEqualToK\MinimumOperationsToMakeArrayValuesEqualToKSeenArray.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.MinimumOperationsToMakeArrayValuesEqualToK;
 13
 14/// <inheritdoc />
 15public class MinimumOperationsToMakeArrayValuesEqualToKSeenArray : IMinimumOperationsToMakeArrayValuesEqualToK
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <param name="k"></param>
 23    /// <returns></returns>
 24    public int MinOperations(int[] nums, int k)
 325    {
 326        var minOperations = 0;
 27
 328        var seenNums = new bool[100];
 29
 3030        foreach (var num in nums)
 1131        {
 1132            if (num < k)
 133            {
 134                return -1;
 35            }
 36
 1037            if (num <= k || seenNums[num - 1])
 438            {
 439                continue;
 40            }
 41
 642            seenNums[num - 1] = true;
 43
 644            minOperations++;
 645        }
 46
 247        return minOperations;
 348    }
 49}