We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Two Characters
  5. Discussions

Two Characters

  • sein_tao
     + 2 comments

    As the number of combinations of letters are <= 26 * 25 / 2 and len(s) <= 1000, It is not needed to optimize the code, is it?

    #!/bin/python3
from itertools import combinations

def meet_pattern(s):
    return all(s[i-1] != s[i] for i in range(1,len(s)))

s_len = int(input().strip())
s = input().strip()
letters = set(s)
max_len = 0
for pair in combinations(letters,2):
    substr = "".join(i for i in s if i in pair)
    if meet_pattern(substr):
        max_len = max(max_len, len(substr))
print(max_len)