Background
A staircase polyomino is a polyomino made of unit squares whose shape resembles a staircase. More formally, a staircase polyomino of size \$n\$ is defined as follows:
A staircase polyomino of size 1 is a single unit square.
A staircase polyomino of size \$n\$ is the same as that of si...
Summary
We already have a challenge for the minimal number of characters for Turing completeness. But what about the minimal maximum byte?
Challenge
For a language of your choice, find a subset of characters that allows your language to be Turing complete with the minimal maximum byte value.
Exam...
Task
Given a string s, output a truthy value if the ASCII code of each letter is divisible by the length of s, and a falsey otherwise.
Input/Output
Input is a nonempty string containing only ASCII [32-126]. Output is a standard truthy/falsey value.
Test cases
Input Output
Hello F...
Despite our help page claiming you only need 1 reputation to participate in Meta, multiple users have reported being unable to post answers on Meta, despite being supposed to be (screenshot of a message that shouldn't exist as proof).
Because of this, new users aren't able to post answers to the ...
Your job is to pick a language and write a syntax highlighter for it in that language. So for example you could pick Java and then code a syntax highlighter for Java in Java.
Whichever submission has the least bytes will win.
Happy golfing!
In this challenge 2 years ago, we found the period of a unit fraction (1/n where n is a natural number).
Now, your task is to write a program/function to find the repetend of a unit fraction.
The repetend is the part of the decimal expansion which repeats infinitely, like:
The decimal represe...
