Cut and Count

AtCoder
IDabc098_b
Time2000ms
Memory256MB
Difficulty
You are given a string $S$ of length $N$ consisting of lowercase English letters. We will cut this string at one position into two strings $X$ and $Y$. Here, we would like to maximize the number of different letters contained in both $X$ and $Y$. Find the largest possible number of different letters contained in both $X$ and $Y$ when we cut the string at the optimal position. ## Constraints * $2 \leq N \leq 100$ * $|S| = N$ * $S$ consists of lowercase English letters. ## Input Input is given from Standard Input in the following format: $N$ $S$ [samples]
Samples
Input #1
6
aabbca
Output #1
2

If we cut the string between the third and fourth letters into $X =$ `aab` and $Y =$ `bca`, the letters contained in both $X$ and $Y$ are `a` and `b`. There will never be three or more different letters contained in both $X$ and $Y$, so the answer is $2$.
Input #2
10
aaaaaaaaaa
Output #2
1

However we divide $S$, only `a` will be contained in both $X$ and $Y$.
Input #3
45
tgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir
Output #3
9
API Response (JSON)
{
  "problem": {
    "name": "Cut and Count",
    "description": {
      "content": "You are given a string $S$ of length $N$ consisting of lowercase English letters. We will cut this string at one position into two strings $X$ and $Y$. Here, we would like to maximize the number of di",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc098_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a string $S$ of length $N$ consisting of lowercase English letters. We will cut this string at one position into two strings $X$ and $Y$. Here, we would like to maximize the number of di...",
      "is_translate": false,
      "language": "English"
    }
  ]
}
Full JSON Raw Segments