1624_largest_substring_between_two_equal_characters.py

class Solution:
    def maxLengthBetweenEqualCharacters(self, s: str) -> int:
        ch_dict = {}
        for i in range(len(s)):
            if s[i] not in ch_dict:
                ch_dict[s[i]] = [i]
            else:
                ch_dict[s[i]].append(i)
        largest_length = -1
        for key in ch_dict.keys():
            if len(ch_dict[key]) > 1:
                largest_length = max(largest_length, ch_dict[key][-1] - ch_dict[key][0] - 1)
        return largest_length

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''