Background
An ex-increasing set sequence of order \$N\$ is defined as a sequence of integer sets \$S_1,S_2,\cdots,S_n\$ which satisfies the following:
Each \$S_i\$ is a non-empty subset of \$\{1,2,\cdots,N\}\$.
For \$1\le i<N\$, \$S_i \cap S_{i+1} = \phi\$, i.e. any two consecutive sets have n...
0
Introduction
We all know the cool S (also known as Superman S, Stüssy S, Super S, Skater S, Pointy S, Graffiti S etc. etc.): billions of schoolchildren around the world drew this S and immediately felt proud of themselves. In case you've forgotten or had a completely uncool childhood, here is an...
Alternating Pattern
In a now deleted stackoverflow question someone posted the following:
White a program or function to print alternating patterns in * and # based on a given integer n. Some examples:
Input: n=1
Output:
*
Input n=5
Output:
*####
###**
***##
###**
*####
Input: n=8
Output...
Double JSON
Input a JSON, double every values in it, and output.
Input
A String. It is guaranteed to be a valid[1] JSON.
Output
A String. It should be a valid JSON.
For each value in the inputed JSON:
If the value is an array, repeat the array twice
[x, y, z] -> [x', y', z', x', y', z']...
Your program has to have an year like 1957 to be the input and then output the century of that year.
For example:
In: 1946
Out: 20
In: 1705
Out: 18
In: 1900
Out: 19
In: 100
Out: 1
In: 2001
Out 20
because 1946 is in the 20th century.
Keep in mind that 2000 should be 20th century or 1900 shoul...
Introduction
Today's challenge is all about teeth. Specifically, how long it takes to brush from one tooth to another. Your challenge is, given the locations of two teeth, output the shortest amount of time possible to brush from the first to the second.
Challenge
For this challenge we will be...
