| | | 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.CheckIfArrayPairsAreDivisibleByK; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class CheckIfArrayPairsAreDivisibleByKArray : ICheckIfArrayPairsAreDivisibleByK |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(k) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="arr"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public bool CanArrange(int[] arr, int k) |
| | 8 | 25 | | { |
| | 8 | 26 | | var remainderCount = new int[k]; |
| | | 27 | | |
| | 116 | 28 | | foreach (var item in arr) |
| | 46 | 29 | | { |
| | 46 | 30 | | var remainder = ((item % k) + k) % k; |
| | | 31 | | |
| | 46 | 32 | | remainderCount[remainder]++; |
| | 46 | 33 | | } |
| | | 34 | | |
| | 8 | 35 | | if (remainderCount[0] % 2 != 0) |
| | 1 | 36 | | { |
| | 1 | 37 | | return false; |
| | | 38 | | } |
| | | 39 | | |
| | 200032 | 40 | | for (var i = 1; i <= k / 2; i++) |
| | 100010 | 41 | | { |
| | 100010 | 42 | | if (remainderCount[i] != remainderCount[k - i]) |
| | 1 | 43 | | { |
| | 1 | 44 | | return false; |
| | | 45 | | } |
| | 100009 | 46 | | } |
| | | 47 | | |
| | 6 | 48 | | return true; |
| | 8 | 49 | | } |
| | | 50 | | } |