CT621

Yusuf's verses Reckoning

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Before the gates of the cork grove of Barkhaven close for winter, Yusuf must finish the verses ledger - one figure at a time. 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| <= 152; s contains lowercase English letters.

Example 1:

Input: cccaaaaaccccbb
Output: 5

Example 2:

Input: ccccccccccccccccaaaabbbbbbbbbbacbbcccccaaaabbaccccbbbbbbbbbccccaaabbbbbbbcccccaaccccbb
Output: 16

Example 3:

Input: aaaaaaccccaaccccaccccccccccccaaaabbbbbaaaaaaaaabbbbccbcccccaaaaaaaaaaaaaaaaaabb
Output: 18

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Yusuf's verses Reckoning - EASY Coding Problem | CodeTikki