CyclicSequence | Topcoder Archive

Problem Statement

Given a string s of length n, one can generate an infinite cyclical sequence a₀, a₁, ... as follows. For each non-negative integer i, compute a zero-based index j as j = i%n. a_i is equal to the j-th character of s.
You are given a String s. Return the shortest string which generates the same sequence as s.

Definition

Class:: CyclicSequence
Method:: minimalCycle
Parameters:: String
Returns:: String
Method signature:: String minimalCycle(String s)
(be sure your method is public)

Constraints

s will contain between 1 and 50 characters, inclusive.
Each character in s will be a digit ('0'-'9').

Examples

```
"11111"
```
```
Returns: "1"
```
The sequence generated by this string is ai=1, which can be generated by the string "1".
```
"234234234"
```
```
Returns: "234"
```
```
"567890"
```
```
Returns: "567890"
```
```
"0"
```
```
Returns: "0"
```
```
"678967"
```
```
Returns: "678967"
```

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.