WheatWizard
A quiet enigma. We don't know anything about WheatWizard yet.
Posts
See all 30 »You are a low-level censor working for the Ministry of Media Accuracy. Part of your job is to make sure that certain words don't appear in publications. Every morning you get a fresh stack of next...
4 answers · posted 3y ago by WheatWizard · last activity 3y ago by Shaggy
Given a list of non-negative integers the function $f$ replaces every integer with the number of identical integers preceding it (not necessarily contiguously). So f [1,1,2,2,1,3,3] = [1,2,1,2,3,1...
2 answers · posted 3y ago by WheatWizard · last activity 5mo ago by Shaggy
You work at a beach. In the afternoon, the sun gets quite hot and beachgoers want to be shaded. So you put out umbrellas. When you put out umbrellas you want to shade the entire beach, with as few ...
2 answers · posted 3y ago by WheatWizard · last activity 3y ago by justhalf
Given two binary strings $A$ and $B$ such that $A$ is an anagram of $B$, output a third binary string $S$ such that both $A$ and $B$ can be created by iterated removals of the substring $10101$ fro...
2 answers · posted 3y ago by WheatWizard · last activity 1y ago by m90
Task Given a list of numbers $X$ produce a second list of numbers $Y$ such that $Y_i$ is the length of the longest common prefix of $X$ and $X$ with the first $i$ elements removed. For example if...
4 answers · posted 3y ago by WheatWizard · last activity 5mo ago by Shaggy
In this challenge you will take a number $n$ and a string $X$ of length $\geq n$, and produce a regular expression which matches all strings that are within $n$ character substitutions of $X$. Spe...
4 answers · posted 3y ago by WheatWizard · last activity 6mo ago by jhnc
Haskell + hgl, 14 bytes xBl<<ss><fn<iw Attempt This Online! Explanation ss gets all substrings of the input fn filters out the substrings that don't ... iw checks if the fo...
posted 3y ago by WheatWizard · edited 3y ago by WheatWizard
Given a number $n \geq 3$ as input output the smallest number $k$ such that the modular residues of $k$ by the first $n$ primes is exactly $\{-1,0,1\}$. That is there is a prime in the first $n$ p...
0 answers · posted 3y ago by WheatWizard · edited 3y ago by WheatWizard
I'm going to reiterate and build off ideas I laid out on this post on PPCG. First let's point out that at current the leader board does not support fractional scores. In this answer I am going to ...
posted 3y ago by WheatWizard · edited 3y ago by WheatWizard
Task You are going to take three strings as input $A$, $B$ and $X$. And your goal is to determine if there exists a third string $S$ such that both $A$ and $B$ can be formed by iteratively removin...
0 answers · posted 3y ago by WheatWizard · edited 3y ago by WheatWizard
The Universal Crossword has a set of guidelines for crossword puzzle submissions. In this challenge we are going to be concerned with their rules for hidden word themes. A hidden word clue consis...
2 answers · posted 3y ago by WheatWizard · last activity 5mo ago by jhnc
The Fibonacci sequence starts with [1,1] and then continues to the right with each number being the sum of the previous number. For example the first 10 terms are [1,1,2,3,5,8,13,21,34,55]. We ca...
1 answer · posted 2mo ago by WheatWizard · last activity 1mo ago by jhnc
An $n$-polyomino is a connected subset of the square tiling consisting of $n$ squares. We will not require that polyominos be simply connected, that is they can have holes. We will say a $n$-polyo...
1 answer · posted 3y ago by WheatWizard · edited 3y ago by WheatWizard
An polyomino is a non-empty connected subset of the square tiling consisting of squares joined along their edges. We will not require that polyominos be simply connected, that is they can have hole...
0 answers · posted 3y ago by WheatWizard
Haskell + hgl, 134 bytes k=cy"X.XX" x#1=[4,0,9,9]!x 2#y=8 3#y=[8,9,4,4]!y x#3=[0,3]!x _#_=0 x?y|(n,j)<-fvD 4$x%4#(y%4)=tk y$dr j$tk x<dr n<cy[dr2 k,k,cy".X",k] Attempt This Onlin...
posted 3y ago by WheatWizard · edited 3y ago by WheatWizard
