Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »

Posts by WheatWizard‭

21 posts
81%
+7 −0
Challenges 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...

4 answers  ·  posted 10mo ago by WheatWizard‭  ·  last activity 10mo ago by Shaggy‭

Question code-golf string
75%
+4 −0
Challenges Calculate the Z-array

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...

1 answer  ·  posted 10mo ago by WheatWizard‭  ·  last activity 10mo ago by TheCodidacter, or rather ACodidacter‭

Question code-golf list array
75%
+4 −0
Challenges 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...

1 answer  ·  posted 4mo ago by WheatWizard‭  ·  last activity 2mo ago by isaacg‭

71%
+3 −0
Challenges 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 ...

2 answers  ·  posted 6mo ago by WheatWizard‭  ·  last activity 5mo ago by justhalf‭

Question code-golf array
66%
+2 −0
Challenges 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 hole...

0 answers  ·  posted 10mo ago by WheatWizard‭

66%
+2 −0
Challenges 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...

1 answer  ·  posted 21d ago by WheatWizard‭  ·  last activity 6d ago by Arpad Horvath‭

66%
+2 −0
Challenges 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...

1 answer  ·  posted 2mo ago by WheatWizard‭  ·  last activity 2mo ago by isaacg‭

66%
+2 −0
Challenges 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 consis...

1 answer  ·  posted 6mo ago by WheatWizard‭  ·  last activity 6mo ago by Razetime‭

66%
+2 −0
Challenges 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$ p...

0 answers  ·  posted 10mo ago by WheatWizard‭  ·  edited 10mo ago by WheatWizard‭

66%
+2 −0
Challenges 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$ fro...

0 answers  ·  posted 10mo ago by WheatWizard‭

66%
+2 −0
Challenges 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 removin...

0 answers  ·  posted 10mo ago by WheatWizard‭  ·  edited 10mo ago by WheatWizard‭

66%
+2 −0
Challenges 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$. Sp...

3 answers  ·  posted 10mo ago by WheatWizard‭  ·  last activity 10mo ago by WheatWizard‭

66%
+2 −0
Challenges Efficient censorship

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 10mo ago by WheatWizard‭  ·  edited 10mo ago by WheatWizard‭

Answer
66%
+2 −0
Meta 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 ...

posted 10mo ago by WheatWizard‭  ·  edited 10mo ago by WheatWizard‭

Answer
66%
+2 −0
Challenges Connect the corners without 4 in a row

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 10mo ago by WheatWizard‭  ·  edited 10mo ago by WheatWizard‭

Answer
66%
+2 −0
Challenges 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$-polyo...

1 answer  ·  posted 11mo ago by WheatWizard‭  ·  edited 10mo ago by WheatWizard‭

60%
+1 −0
Challenges Build a replacement ball in regex.

Haskell + hgl, 30 bytes ic"|"<<tv(:".")><fl<ce '.'><eq Attempt This Online! Explanation This performs a cartesian product to get all possible ways to replace characters w...

posted 10mo ago by WheatWizard‭

Answer
60%
+1 −0
Challenges 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...

0 answers  ·  posted 9mo ago by WheatWizard‭

Question code-golf
60%
+1 −0
Challenges 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$ outpu...

0 answers  ·  posted 7mo ago by WheatWizard‭  ·  edited 7mo ago by WheatWizard‭

57%
+2 −1
Challenges 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,...

0 answers  ·  posted 8mo ago by WheatWizard‭  ·  edited 8mo ago by WheatWizard‭

50%
+0 −0
Challenges Cumulative Counts

Haskell + hgl, 10 bytes 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 ... g...

posted 10mo ago by WheatWizard‭

Answer