11 deleted 43 characters in body
source | link

This is taken from this question (with permission ofcourse). I'll quote:

Create a function which takes a string, and it should return true or false based on whether the input consists of only a repeated character sequence. The length of given string is always greater than 1 and the character sequence must have at least one repetition.

Some examples:

'aa' //true
'aaa' //true
'abcabcabc' //true
'aba' //false
'ababa' //false
'weqweqweqweqweqw' // false

Specifically, the check for a string strictly composed of repeating substrings, should return true, otherwise false. (Update: The output) can beoutput any true or false valuerepresentation, but no error output please. Strictly alphhanumeric strings. Otherwise standard code golf rules. Shortest answer in bytes for each language wins.

This is taken from this question (with permission ofcourse). I'll quote:

Create a function which takes a string, and it should return true or false based on whether the input consists of only a repeated character sequence. The length of given string is always greater than 1 and the character sequence must have at least one repetition.

Some examples:

'aa' //true
'aaa' //true
'abcabcabc' //true
'aba' //false
'ababa' //false
'weqweqweqweqweqw' // false

Specifically, the check for a string strictly composed of repeating substrings, should return true, otherwise false. Update: The output can be any true or false value, but no error output please. Strictly alphhanumeric strings. Otherwise standard code golf rules. Shortest answer in bytes for each language wins.

This is taken from this question (with permission ofcourse). I'll quote:

Create a function which takes a string, and it should return true or false based on whether the input consists of only a repeated character sequence. The length of given string is always greater than 1 and the character sequence must have at least one repetition.

Some examples:

'aa' //true
'aaa' //true
'abcabcabc' //true
'aba' //false
'ababa' //false
'weqweqweqweqweqw' // false

Specifically, the check for a string strictly composed of repeating substrings (Update) can output any true or false representation, but no error output please. Strictly alphhanumeric strings. Otherwise standard code golf rules. Shortest answer in bytes for each language wins.

10 added 2 characters in body
source | link

This is taken from this question (with permission ofcourse). I'll quote:

Create a function which takes a string, and it should return true or false based on whether the input consists of only a repeated character sequence. The length of given string is always greater than 1 and the character sequence must have at least one repetition.

Some examples:

'aa' //true
'aaa' //true
'abcabcabc' //true
'aba' //false
'ababa' //false
'weqweqweqweqweqw' // false

To specifySpecifically, the check for a string strictly composed of repeating substrings, should return true, otherwise false. Update: The output can be any true or false value, but no error output please. Strictly alphhanumeric strings. Otherwise standard code golf rules. Shortest answer in bytes for each language wins.

This is taken from this question (with permission ofcourse). I'll quote:

Create a function which takes a string, and it should return true or false based on whether the input consists of only a repeated character sequence. The length of given string is always greater than 1 and the character sequence must have at least one repetition.

Some examples:

'aa' //true
'aaa' //true
'abcabcabc' //true
'aba' //false
'ababa' //false
'weqweqweqweqweqw' // false

To specify, the check for a string strictly composed of repeating substrings, should return true, otherwise false. Update: The output can be any true or false value, but no error output please. Strictly alphhanumeric strings. Otherwise standard code golf rules. Shortest answer in bytes for each language wins.

This is taken from this question (with permission ofcourse). I'll quote:

Create a function which takes a string, and it should return true or false based on whether the input consists of only a repeated character sequence. The length of given string is always greater than 1 and the character sequence must have at least one repetition.

Some examples:

'aa' //true
'aaa' //true
'abcabcabc' //true
'aba' //false
'ababa' //false
'weqweqweqweqweqw' // false

Specifically, the check for a string strictly composed of repeating substrings, should return true, otherwise false. Update: The output can be any true or false value, but no error output please. Strictly alphhanumeric strings. Otherwise standard code golf rules. Shortest answer in bytes for each language wins.

9 added 3 characters in body
source | link

This is taken from this question (with permission ofcourse). I'll quote:

Create a function which takes a string, and it should return true or false based on whether the input consists of only a repeated character sequence. The length of given string is always greater than 1 and the character sequence must have at least one repetition.

Some examples:

'aa' //true
'aaa' //true
'abcabcabc' //true
'aba' //false
'ababa' //false
'weqweqweqweqweqw' // false

To specify, the check for a string strictly composed of repeating substrings, should return true, otherwise false. Update: The output can be any true or false value, but no error output please. Strictly alphhanumeric strings. Otherwise standard code golf rules. Shortest answer in bytes for each language wins.

This taken from this question (with permission ofcourse). I'll quote:

Create a function which takes a string, and it should return true or false based on whether the input consists of only a repeated character sequence. The length of given string is always greater than 1 and the character sequence must have at least one repetition.

Some examples:

'aa' //true
'aaa' //true
'abcabcabc' //true
'aba' //false
'ababa' //false
'weqweqweqweqweqw' // false

To specify, the check for a string strictly composed of repeating substrings, should return true, otherwise false. Update: The output can be any true or false value, but no error output please. Strictly alphhanumeric strings. Otherwise standard code golf rules. Shortest answer in bytes for each language wins.

This is taken from this question (with permission ofcourse). I'll quote:

Create a function which takes a string, and it should return true or false based on whether the input consists of only a repeated character sequence. The length of given string is always greater than 1 and the character sequence must have at least one repetition.

Some examples:

'aa' //true
'aaa' //true
'abcabcabc' //true
'aba' //false
'ababa' //false
'weqweqweqweqweqw' // false

To specify, the check for a string strictly composed of repeating substrings, should return true, otherwise false. Update: The output can be any true or false value, but no error output please. Strictly alphhanumeric strings. Otherwise standard code golf rules. Shortest answer in bytes for each language wins.

    Tweeted twitter.com/StackCodeGolf/status/1121111734914306048
8 added 8 characters in body
source | link
7 deleted 8 characters in body
source | link
6 added 119 characters in body
source | link
5 added 26 characters in body
source | link
4 edited tags
| link
    Became Hot Network Question
3 added 33 characters in body
source | link
2 added 9 characters in body
source | link
1
source | link