< Summary

Information
Class: LeetCode.Algorithms.XORQueriesOfSubarray.XORQueriesOfSubarrayPrefixArray
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\XORQueriesOfSubarray\XORQueriesOfSubarrayPrefixArray.cs
Line coverage
100%
Covered lines: 13
Uncovered lines: 0
Coverable lines: 13
Total lines: 42
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
XorQueries(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\XORQueriesOfSubarray\XORQueriesOfSubarrayPrefixArray.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.XORQueriesOfSubarray;
 13
 14/// <inheritdoc />
 15public class XORQueriesOfSubarrayPrefixArray : IXORQueriesOfSubarray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(m + n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="arr"></param>
 22    /// <param name="queries"></param>
 23    /// <returns></returns>
 24    public int[] XorQueries(int[] arr, int[][] queries)
 425    {
 426        var prefixArray = new int[arr.Length + 1];
 27
 3628        for (var i = 0; i < arr.Length; i++)
 1429        {
 1430            prefixArray[i + 1] = prefixArray[i] ^ arr[i];
 1431        }
 32
 433        var result = new int[queries.Length];
 34
 3435        for (var i = 0; i < queries.Length; i++)
 1336        {
 1337            result[i] = prefixArray[queries[i][1] + 1] ^ prefixArray[queries[i][0]];
 1338        }
 39
 440        return result;
 441    }
 42}