Activity for WheatWizard‭

Type	On...	Excerpt	Status	Date
Question	—	Construct the Irish possessive In this challenge you will take an Irish word and a personal pronoun and create the possessive pronoun construction combining the two. For example `sé`, `madra` becomes `a mhadra`. Translated to English `he`, `dog` becomes `his dog`. Rather than exhaustively describing how valid Irish words are... (more)	—	about 2 months ago
Question	—	Can I follow this recipe? You work in a kitchen which has a peculiar rule. When you mix something into a pot you must always add at least one new ingredient. So you can add pasta, oil, salt then pesto, but not pasta, pesto, salt and oil since pesto already contains salt and oil. You only have one pot per dish, so you can't... (more)	—	3 months ago
Question	—	Is it stuck in a counting loop? 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] ``` We will say that a list, $X$, is in a loop if there is some positive integer $n$ such... (more)	—	5 months ago
Question	—	Is it a valid hidden word? 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 consists of a clue and a word. It can either be a "word break" or a "bookend". For a word break the word... (more)	—	7 months ago
Question	—	How many umbrellas to cover the beach? 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 umbrellas as possible. Umbrellas come in many sizes. However, larger umbrellas are susceptible to bei... (more)	—	7 months ago
Question	—	I irradiate your source code, you irradiate your output Your task is to write a program $p$ which outputs a string $s$ with the same length as $p$, where $s \neq p$. If I remove the $n$th byte from your program to get program $q$, then either $q$ outputs $s$ with the $n$th byte removed, or it does something else. Your score is the number of ways a s... (more)	—	8 months ago
Question	—	Give the fool's fibonacci sequence Recently I asked for tips on improving some code-golf of mine. The code was supposed to output every third value of the Fibonacci sequence starting with 2: ``` 2,8,34,144,610,2584,10946,46368,196418,832040 ``` However, I made a mistake in deriving my formula, and my code output a different s... (more)	—	9 months ago
Question	—	Reverse engineer the colors for a layout. At my job we have to sometimes lay out materials. Materials come in large long rolls and are cut into smaller pieces when being laid out. When we order the rolls we draw up a layout document which describes how we are going to cut them and layout the pieces. This tells the manufacturer how we are ... (more)	—	10 months ago
Question	—	Find near miss prime multiples. 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$ primes that divides $k$, one that divides $k+1$ and one that divides $k-1$, and every prime in the firs... (more)	—	11 months ago
Question	—	Prove commutativity on this monoid presentation. 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$ from $S$. For example for $A=100$ and $B = 010$, one solution is $S = 10101010$ since $$ (10101)01... (more)	—	11 months ago
Answer	—	A: Cumulative Counts Haskell + hgl, 10 bytes ```haskell mpn$ce<gj ```` Attempt This Online! Explanation - `mpn` map across all non-empty prefixes of the input ... - `ce` count the number of elements in each prefix equal to ... - `gj` the last element of that prefix. Reflection I'm happy with this. ... (more)	—	11 months ago
Answer	—	A: Build a replacement ball in regex. Haskell + hgl, 30 bytes ```haskell ic"|"<pST<eL<P1 ``` This version is much longer, but in my opinion it has better potential to be shorter than the above version if hgl were improved. Explanation This adds a dummy character `?` to the front of the list then gets all ways to partition t... (more)	—	11 months ago
Question	—	Are these reduced forms of the same thing? 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 removing contiguous instances of $X$ in $S$. For example if $X = 10101$ then both $10$ and $01$ can be forme... (more)	—	11 months ago
Question	—	Build a replacement ball in regex. 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 withing $n$ character substitutions of $X$. Specifically you will take $X$ and $n$ and ouptut all the ways to replace exactly $n$ characters with th... (more)	—	11 months ago
Answer	—	A: Efficient censorship Haskell + hgl, 14 bytes ```haskell xBl<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 forbidden word is a contiguous substring `xBl` gets the largest result Reflection There... (more)	—	11 months ago
Answer	—	A: Codidact Fractional Byte Consensus 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 assume this is unchanged. That may prove to be false, in fact I think it is likely a false assumption,... (more)	—	11 months ago
Question	—	Efficient censorship 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 week's newspapers and its your job to comb through them and fix any of the words that were mistakenly i... (more)	—	11 months ago
Answer	—	A: Connect the corners without 4 in a row Haskell + hgl, 134 bytes ```haskell 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 Online! I first set up a pretty dense background pattern which doesn't break any rules: ``` X... (more)	—	11 months ago
Question	—	Calculate the Z-array Task Given a list of numbers $X$ produce a second list of numbers $Y$ such that $Yi$ is the length of the longest common prefix of $X$ and $X$ with the first $i$ elements removed. For example if the input is ``` [1,2,2,1,1,2,1,2,2,1,2,1] ``` The output should be ``` [12,0,0,1,2,0,4,... (more)	—	11 months ago
Question	—	Count polyomino bisections 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 holes. A bisection of a polyomino $X$ is a pair of polyominos such that they can be joined together witho... (more)	—	11 months ago
Question	—	Determine if a polyomino is "prime" 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$-polyomino is prime if it cannot be disected into disjoint $k$-polyominos for any 1<$k$<$n$. For example th... (more)	—	11 months ago