| | | 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.LengthOfLongestSubarrayWithAtMostKFrequency; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class LengthOfLongestSubarrayWithAtMostKFrequencyIterative : ILengthOfLongestSubarrayWithAtMostKFrequency |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n^2) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int MaxSubarrayLength(int[] nums, int k) |
| | 15 | 25 | | { |
| | 15 | 26 | | var maxLength = 0; |
| | | 27 | | |
| | 222 | 28 | | for (var i = 0; i < nums.Length; i++) |
| | 96 | 29 | | { |
| | 96 | 30 | | var dictionary = new Dictionary<int, int>(); |
| | | 31 | | |
| | 876 | 32 | | for (var j = i; j < nums.Length; j++) |
| | 375 | 33 | | { |
| | 375 | 34 | | if (dictionary.TryAdd(nums[j], 1)) |
| | 219 | 35 | | { |
| | 219 | 36 | | continue; |
| | | 37 | | } |
| | | 38 | | |
| | 156 | 39 | | if (dictionary[nums[j]] == k) |
| | 33 | 40 | | { |
| | 33 | 41 | | maxLength = Math.Max(maxLength, j - i); |
| | | 42 | | |
| | 33 | 43 | | break; |
| | | 44 | | } |
| | | 45 | | |
| | 123 | 46 | | dictionary[nums[j]]++; |
| | 123 | 47 | | } |
| | | 48 | | |
| | 315 | 49 | | maxLength = Math.Max(maxLength, dictionary.Select(d => d.Value).Sum()); |
| | 96 | 50 | | } |
| | | 51 | | |
| | 15 | 52 | | return maxLength; |
| | 15 | 53 | | } |
| | | 54 | | } |