| | | 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 | | |
| | | 12 | | namespace LeetCode.Algorithms.CountTripletsThatCanFormTwoArraysOfEqualXOR; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class CountTripletsThatCanFormTwoArraysOfEqualXORIterative : ICountTripletsThatCanFormTwoArraysOfEqualXOR |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n^2) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="arr"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int CountTriplets(int[] arr) |
| | 3 | 24 | | { |
| | 3 | 25 | | var count = 0; |
| | | 26 | | |
| | 3 | 27 | | var prefixXor = new int[arr.Length + 1]; |
| | | 28 | | |
| | 36 | 29 | | for (var i = 0; i < arr.Length; i++) |
| | 15 | 30 | | { |
| | 15 | 31 | | prefixXor[i + 1] = prefixXor[i] ^ arr[i]; |
| | 15 | 32 | | } |
| | | 33 | | |
| | 36 | 34 | | for (var i = 0; i < arr.Length; i++) |
| | 15 | 35 | | { |
| | 90 | 36 | | for (var k = i + 1; k < arr.Length; k++) |
| | 30 | 37 | | { |
| | 30 | 38 | | if (prefixXor[i] == prefixXor[k + 1]) |
| | 14 | 39 | | { |
| | 14 | 40 | | count += k - i; |
| | 14 | 41 | | } |
| | 30 | 42 | | } |
| | 15 | 43 | | } |
| | | 44 | | |
| | 3 | 45 | | return count; |
| | 3 | 46 | | } |
| | | 47 | | } |