CT25685

Elowen's Gleaming Ledger

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The dispatch writer Elowen has been asked to document the rare sighting. On the desk lies a long table of inscriptions readings. Task: Print the length of the longest run of the same character. Input format: One line with a single lowercase string s. Output format: Print the maximum run length. Constraints: 1 <= |s| <= 604; s contains lowercase English letters.

Example 1:

Input: ccccaaccccbbbbbaaaaabbbbbcccccbbbbbccccccccbbbbbcccccaaaaaaaaaaaaaaccaaaaabbbbbcccabbbccccabbbaaaaaabbbbbaaaacccaaaaaccccccccccaaabbbbbbbbbbaaaabbbbaaaaabbbbbbccccaabaabbbbbcccccbbbbaaccccccccccaaaaaabbbbbaabbbbbbbbb
Output: 14

Example 2:

Input: baaaaaabbaaabaaaaaaaaabbbbbbbcccccbbbbbaaaaabbbbbbcbbbbbccbbbbbccaaaabbbbbbbbbbbbbbbbbbbabbbbcccccccccaaaaaaaaaaaacccccaabccccbcccccaaaaaaaccccaaaaabbbbaaabbbaaaaaaaaaabbbbbbccccccccccccbbbbbccccbbbacccccccaaaccaaaaaccccaaaaaaaaaaabbbbbbbbbbccccaaaaaccccccccccccccacccccccccbccbbbbbccccccccaacccccccccccccbaaaaaa
Output: 19

Example 3:

Input: aaaabbaaaaaaaabbaacccaaaaaabbbbbbbcccbbbbbbcbbbbaaaaaaaaaaccaaaaabbbbbccabbcccbccccbbbbbaaaacccbbbbaaaaabbbbbbccccaaaaaccccccccccbbbbbcccccaccccaabbbacccccbbbbbbbccaaaaaaaabbaaaaaaaccbbaaaa
Output: 10

Constraints:

1 <= |s| <= 604; s contains lowercase English letters.

Loading...
Test Cases:No test cases
No test cases available.
Elowen's Gleaming Ledger - EASY Coding Problem | CodeTikki