Kata

For a given nonempty str find a minimum substring and the maximum number of this str, such that the entire str is equal to repeated times.

The input string consists of lowercase latin letters.
substring does not have repetitive letters.

Here is an example of almost similar but more challenging task.

Example:

str = "zyzyzy";
// should return ['zy',3]