< Summary

Information
Class: LeetCode.Algorithms.MinimumNumberOfOperationsToMakeArrayXOREqualToK.MinimumNumberOfOperationsToMakeArrayXOREqualToKIterativeBits
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumNumberOfOperationsToMakeArrayXOREqualToK\MinimumNumberOfOperationsToMakeArrayXOREqualToKIterativeBits.cs
Line coverage
100%
Covered lines: 14
Uncovered lines: 0
Coverable lines: 14
Total lines: 47
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
MinOperations(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumNumberOfOperationsToMakeArrayXOREqualToK\MinimumNumberOfOperationsToMakeArrayXOREqualToKIterativeBits.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.MinimumNumberOfOperationsToMakeArrayXOREqualToK;
 13
 14/// <inheritdoc />
 15public class MinimumNumberOfOperationsToMakeArrayXOREqualToKIterativeBits :
 16    IMinimumNumberOfOperationsToMakeArrayXOREqualToK
 17{
 18    /// <summary>
 19    ///     Time complexity - O(n)
 20    ///     Space complexity - O(1)
 21    /// </summary>
 22    /// <param name="nums"></param>
 23    /// <param name="k"></param>
 24    /// <returns></returns>
 25    public int MinOperations(int[] nums, int k)
 226    {
 1027        var xor = nums.Aggregate(0, (current, num) => current ^ num);
 28
 229        if (xor == k)
 130        {
 131            return 0;
 32        }
 33
 134        var differingBits = xor ^ k;
 35
 136        var minOperations = 0;
 37
 438        while (differingBits != 0)
 339        {
 340            minOperations += differingBits & 1;
 41
 342            differingBits >>= 1;
 343        }
 44
 145        return minOperations;
 246    }
 47}