I found the following code example for Java on RosettaCode:
public static boolean prime(int n) {
return !new String(new char[n]).matches(".?|(..+?)\\1+");
}
I don't know Java in particular but understand all aspects of this snippet except for the regex itself
I have basic to basic-advanced ...
0
code-golfsequence
Do I flip the side?
Introduction
When writing on a piece of paper folded \$n\$ times you have \$2^{n+1}\$ sides available to write on. When writing on those sides, you can imagine the following sequence of actions (for \$n=2\$):
write on the first side and fill the whole side,
...
Which character did I delete?
Your task is, to make a program that outputs anything.
If I delete a character from your code, you're program should output the character.
Rules
Default Loopholes apply
The program must be at least 1 byte long
Trailing newline/whitespace in the output is allowed
Th...
