| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.LargestSubstringBetweenTwoEqualCharacters; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class LargestSubstringBetweenTwoEqualCharactersLookup : ILargestSubstringBetweenTwoEqualCharacters |
| | | 16 | | { |
| | | 17 | | private const byte AlphabetLength = 'z' - 'a' + 1; |
| | | 18 | | |
| | | 19 | | /// <summary> |
| | | 20 | | /// Time complexity - O(n) |
| | | 21 | | /// Space complexity - O(1) |
| | | 22 | | /// </summary> |
| | | 23 | | /// <param name="s"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int MaxLengthBetweenEqualCharacters(string s) |
| | 3 | 26 | | { |
| | 3 | 27 | | Span<int> positions = stackalloc int[AlphabetLength]; |
| | | 28 | | |
| | 3 | 29 | | var maxLength = -1; |
| | | 30 | | |
| | 28 | 31 | | for (var i = 0; i < s.Length; i++) |
| | 11 | 32 | | { |
| | 11 | 33 | | var index = s[i] - 'a'; |
| | | 34 | | |
| | 11 | 35 | | var position = positions[index]; |
| | | 36 | | |
| | 11 | 37 | | if (position == 0) |
| | 9 | 38 | | { |
| | 9 | 39 | | positions[index] = i + 1; |
| | 9 | 40 | | } |
| | | 41 | | else |
| | 2 | 42 | | { |
| | 2 | 43 | | var length = i - position; |
| | | 44 | | |
| | 2 | 45 | | maxLength = Math.Max(maxLength, length); |
| | 2 | 46 | | } |
| | 11 | 47 | | } |
| | | 48 | | |
| | 3 | 49 | | return maxLength; |
| | 3 | 50 | | } |
| | | 51 | | } |