0
00:00 - 15:0015:00 - 00:00
3
3
This is a Cops and Robbers challenge. For the Robbers' thread, go here.
The Cops have three tasks.
1) Pick a sequence from the OEIS.
2) Pick a language (this is suggested to be a golflang, but doesn't have to be) that, when given input n, outputs A(n) (where A(n) is the sequence chosen) using...
Inspiration.
Consider a list l, consisting of numbers. Define a block operation at index i on the list l to be the act of moving 3 consecutive elements starting from i in l to the end.
Example:
l, i (1-indexing) -> l (after applying block operation at index i)
[1,2,3,4,5], 1 -> [4,5,1,2,3]
[1,...
Input
A string of printable ASCII characters, for example:
This is an example string.
Output
For every consonant (BCDFGHJKLMNPQRSTVWXYZbcdfghjklmnpqrstvwxyz) that is not followed by a vowel (AEIOUaeiou) add the last vowel before it, in lowercase.
Consonants before the first vowel are left as...
Acceptable IO :
I would like to ask and request a strict out final policy on what is considered a valid submission to a challenge and what does not.
Following are some methods I have seen :
A lambda function that takes arguments and returns an answer
A full program that takes input and pr...
Convert a list of nodes in the format:
[{
id: 1,
parentId: 1
},
{
id: 2,
parentId: 1
},
{
id: 3,
parentId: 1
},
{
id: 4,
parentId: 2
},
{
id: 5,
parentId: 3
},
{
id: 6,
parentId: 4
}]
To a tree of the format:
{
"id": 1,...1
Background
Three years ago, this guy Tom Murphy got it into his head to extend the idea of a portmanteau to all words in a language and called this a portmantout (portmanteau plus tout [French for all]). Defining English as a list of 108,709 words, he managed to find a sequence of 611,820 letter...
00:00 - 15:0015:00 - 00:00
