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 caird coinheringaahing‭

16 posts
89%
+15 −0
Meta Should challenges be worth 10 reputation?

The fourth highest voted CGCC Meta question asks that SE increases reputation for questions. This is now status completed across the entirety of the Stack Exchange network. However, I notice that i...

2 answers  ·  posted 3y ago by caird coinheringaahing‭  ·  last activity 3y ago by Monica Cellio‭

80%
+6 −0
Challenges Weave Strings Together

Jelly, 2 1 byte Z Try it online! -1 byte thanks to Razetime! Full program How it works Z - Main link. Takes a list L on the left Z - Transpose Implicitly print, smashing lists togethe...

posted 3y ago by caird coinheringaahing‭  ·  edited 3y ago by caird coinheringaahing‭

Answer
80%
+6 −0
Challenges Juggler sequences

A Juggler sequence is a sequence that begins with a positive integer $a_0$ and each subsequent term is calculated as: $$a_{k+1} = \begin{cases} \left \lfloor a_k ^ \frac 1 2 \right \rfloor, &...

9 answers  ·  posted 3y ago by caird coinheringaahing‭  ·  last activity 3y ago by Shaggy‭

77%
+5 −0
Challenges Are they abundant, deficient or perfect?

Abundant numbers are numbers which are less than their proper divisor sum. For example $18$ is abundant as $1 + 2 + 3 + 6 + 9 = 21 > 18$ Deficient numbers are numbers which are greater than the...

8 answers  ·  posted 3y ago by caird coinheringaahing‭  ·  last activity 3y ago by General Sebast1an‭

75%
+4 −0
Challenges Evens or Odds - you know this one

Jelly, 1 byte Ḃ Try it online! Builtin. Returns 0 for even and 1 for odd

posted 3y ago by caird coinheringaahing‭

Answer
71%
+3 −0
Challenges Beaver Code Decryption

Jelly, 9 bytes ŒHß¹Ḋ?€ZẎ Try it online! How it works ŒHß¹Ḋ?€ZẎ - Main link f(S). Takes a string S on the left ŒH - Split S into two halves € - Over each half H: ? - ...

posted 3y ago by caird coinheringaahing‭

Answer
71%
+3 −0
Challenges Backspace an array

Jelly, 6 bytes ṣ0Ṗ;¥/ Try it online! How it works ṣ0Ṗ;¥/ - Main link. Takes a list on the left ṣ0 - Split at zeroes ¥/ - Reduce by: Ṗ - Remove the last element ; - C...

posted 3y ago by caird coinheringaahing‭

Answer
71%
+3 −0
Challenges Create an Alphabet Diamond

Jelly, 13 bytes ØAUƤz⁶ZUŒBŒḄY Try it online! How it works ØAUƤz⁶ZUŒBŒḄY - Main link. Takes no arguments ØA - Yield the uppercase alphabet Ƥ - Over each prefix: U ...

posted 3y ago by caird coinheringaahing‭  ·  edited 3y ago by caird coinheringaahing‭

Answer
71%
+3 −0
Challenges Multiply two strings

Jelly, 2 bytes «þ Try it online! Technically speaking, this needs to be a full program, due to how Jelly's smash printing works, but it can get away with being run as a function over test case...

posted 3y ago by caird coinheringaahing‭  ·  edited 3y ago by caird coinheringaahing‭

Answer
66%
+2 −0
Challenges Evaluation order of an APL n-train

Jelly, 5 bytes ḶHĊUỤ Try it online! Uses xash's method over on CGCC How it works ḶHĊUỤ - Main link. Takes n on the left Ḷ - Range from 0 to n-1 H - Halve Ċ - Ceiling ...

posted 3y ago by caird coinheringaahing‭  ·  edited 3y ago by caird coinheringaahing‭

Answer
66%
+2 −0
Challenges Partial Sums of Harmonic Series

Jelly, 8 bytes İ€S<¬ʋ1# Try it online! How it works İ€S<¬ʋ1# - Main link. Takes n on the left ʋ - Group the previous 4 links into a dyad f(k, n): € - Over each integer...

posted 3y ago by caird coinheringaahing‭

Answer
66%
+2 −0
Challenges Shuffle a subset of a list

Jelly, 7 bytes œPżịẊ¥F Try it online! Takes the 1-indexed indices on the left and the list on the right How it works œPżịẊ¥F - Main link. Takes I on the left and L on the right œP - Pa...

posted 3y ago by caird coinheringaahing‭  ·  edited 3y ago by caird coinheringaahing‭

Answer
66%
+2 −0
Challenges Reduce over the range [1..n]

Jelly, 3 bytes Rç/ Try it online! Takes f as the helper link. Very basic, R casts to range, then ç/ reduces by the helper link

posted 3y ago by caird coinheringaahing‭

Answer
60%
+1 −0
Challenges Add two negabinary integers

Jelly, 6 bytes ḅSbɗ-2 Try it online! Takes input and output as a pair of lists of digits. The Footer converts to and from. Jelly's generalised base conversion works for all integer bases, and...

posted 3y ago by caird coinheringaahing‭  ·  edited 3y ago by caird coinheringaahing‭

Answer
60%
+1 −0
Challenges Are All Elements Equal?

Jelly, 1 byte E Try it online! Boring builtin answer Non builtin, the shortest I can get is 3 bytes: ḷ\⁼ Try it online! Here, we replace each element with the first element, then check i...

posted 3y ago by caird coinheringaahing‭

Answer
60%
+1 −0
Challenges Roll n fair dice

Jelly, 4 bytes X}€S Try it online! How it works X}€S - Main link. Takes n on the left, m on the right € - Over each element of 1 through n: } - With m as its argument: X - Y...

posted 3y ago by caird coinheringaahing‭

Answer