< Summary

Information
Class: LeetCode.Algorithms.CountNumberOfMaximumBitwiseORSubsets.CountNumberOfMaximumBitwiseORSubsetsBacktracking
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CountNumberOfMaximumBitwiseORSubsets\CountNumberOfMaximumBitwiseORSubsetsBacktracking.cs
Line coverage
100%
Covered lines: 18
Uncovered lines: 0
Coverable lines: 18
Total lines: 51
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
CountMaxOrSubsets(...)100%11100%
CountMaxOrSubsetsHelper(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CountNumberOfMaximumBitwiseORSubsets\CountNumberOfMaximumBitwiseORSubsetsBacktracking.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.CountNumberOfMaximumBitwiseORSubsets;
 13
 14/// <inheritdoc />
 15public class CountNumberOfMaximumBitwiseORSubsetsBacktracking : ICountNumberOfMaximumBitwiseORSubsets
 16{
 17    /// <summary>
 18    ///     Time complexity - O(2^n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public int CountMaxOrSubsets(int[] nums)
 324    {
 325        var maxOr = 0;
 326        var count = 0;
 27
 1228        maxOr = nums.Aggregate(maxOr, (current, num) => current | num);
 29
 330        CountMaxOrSubsetsHelper(nums, 0, 0, ref maxOr, ref count);
 31
 332        return count;
 333    }
 34
 35    private static void CountMaxOrSubsetsHelper(int[] nums, int index, int currentOr, ref int maxOr, ref int count)
 5336    {
 5337        if (index == nums.Length)
 2838        {
 2839            if (currentOr == maxOr)
 1540            {
 1541                count++;
 1542            }
 43
 2844            return;
 45        }
 46
 2547        CountMaxOrSubsetsHelper(nums, index + 1, currentOr | nums[index], ref maxOr, ref count);
 48
 2549        CountMaxOrSubsetsHelper(nums, index + 1, currentOr, ref maxOr, ref count);
 5350    }
 51}