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 »

Search

Advanced Search Options

To further refine your search, you can use additional qualifiers such as score:>0.5. For example, the search score:>=0.5 created:<1y grammar would return only posts mentioning "grammar" that have a score >= 0.5 and were created less than a year ago.

Further help with searching is available in the help center.

Quick hints: tag:tagname, user:xxx, "exact phrase", post_type:xxx, created:<N{d,w,mo,y}, score:>=0.5

Filters
1.6k posts
 
66%
+2 −0
Challenges 1, 2, Fizz, 4, Buzz!

Canvas, 24 bytes zz+¹┘%!* ‾U{ŗ3Fi⁸5Bu⁸+nO Try it here! Explanation (ASCII-fied for better monospacing): zz+¹┘%!* Helper function ⁸; Expects stack to be [modulo, string] zz+ append "z...

posted 4y ago by dzaima‭

Answer
66%
+2 −0
Challenges Bytes to Segfault

JavaScript (Node.js), 35 32 25 bytes -7 bytes thanks to @celtschk‭ with(process)kill(pid,11) Try it online!

posted 4y ago by Hakerh400‭  ·  edited 4y ago by Hakerh400‭

Answer
66%
+2 −0
Challenges Weave Strings Together

JavaScript (Node.js), 53 bytes f=(a,b=[],c=a.map(([a,...c])=>(b+=[a],c)))=>b&&b+f(c) Try it online!

posted 4y ago by Hakerh400‭

Answer
66%
+2 −0
Challenges "Hello, World!"

RoadLang, 59 bytes wagwan my slime man say"Hello, World!" chat wit u later fam My first RoadLang answer! And probably the first one on this site! Removing any of the words says "Aight the ...

posted 4y ago by Razetime‭

Answer
66%
+2 −0
Challenges Longest Increasing Subsequence

JavaScript (Node.js), 70 56 bytes f=([a,...b],c=f)=>1/a?Math.max(f(b,c),[a]>c&&1+f(b,a)):0 Try it online!

posted 4y ago by Hakerh400‭  ·  edited 4y ago by Hakerh400‭

Answer
66%
+2 −0
Challenges Longest Increasing Subsequence

Haskell, 37 bytes f(h:t)=max(1+f[x|x<-t,x>h])$f t f _=0 Try it online!

posted 4y ago by xnor‭

Answer
66%
+2 −0
Challenges Given the preorder and the inorder of a tree, output the postorder

C (gcc), 114 bytes f(int n,int*p,int*i,int**o){if(n){int*m=i,k;for(;*m!=*p;++m);k=m-i;f(k,p+1,i,o);f(n-k-1,p+k+1,m+1,o);*(*o)++=*p;}} Try it online! Arguments: n is the length of the arra...

posted 4y ago by celtschk‭  ·  edited 4y ago by celtschk‭

Answer
66%
+2 −0
Challenges Reverse an ASCII string

Befunge-98, 45 39 37 33 29 21 bytes v:~< >a-| >v$< ,: ^_@ Try it online! This answer probably sucks :P

posted 4y ago by moony‭  ·  edited 4y ago by moony‭

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

posix SH + GNU sed, 43 bytes seq $1|tac|sed -zE 's/(\n.+)(\n.+)/\2\1/mg' seq $1 # 1..the argument (inclusive) |tac| # reverse sed # replace...

posted 3y ago by Wezl‭  ·  edited 3y ago by Wezl‭

Answer
66%
+2 −0
Challenges Merge two strings

Jelly, 13 bytes W;;Ƥ@ḣL}¹⁼ʋƇḢ Try it online! Takes the two strings as arguments in reverse order.

posted 3y ago by xigoi‭  ·  edited 3y ago by xigoi‭

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

Haskell, 52 48 45 42 bytes Caught mistake thanks to rak1507 Saved 3 bytes thanks to Hakerh400 f n=n:g[n-1,n-2..1] g(b:c:t)=c:b:g t g t=t Try it online! g takes the rest of the trains. -...

posted 3y ago by user‭  ·  edited 3y ago by user‭

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 Diagonalized alphabet

APL (Dyalog Unicode), 31 bytes ⎕←↑(14↑(2⌷x),⍨⌽)¨,\1⌷x←⍉13 2⍴⎕A Try it online! Lot worse than the BQN answer. ⎕←↑(14↑(2⌷x),⍨⌽)¨,\1⌷x←⍉13 2⍴⎕A ⎕A ⍝ String of up...

posted 3y ago by user‭

Answer
66%
+2 −0
Challenges Truthify an array

Japt -m, 8 7 bytes ð òÎmiV Try it ð òÎmiV :Implicit map of each sub-array at 0-based index V ð :Indices of truthy (i.e., non-zero) elements ò :Partition between eleme...

posted 3y ago by Shaggy‭  ·  edited 3y ago by Shaggy‭

Answer
66%
+2 −0
Challenges Evaluate a single variable polynomial equation

JavaScript (Node.js), 33 bytes a=>n=>a.reduce((o,x,y)=>o+x*n**y) Try it online!

posted 3y ago by Shaggy‭

Answer
66%
+2 −0
Challenges Word Count Tool

APL (Dyalog Unicode), 27 bytes Anonymous tacit prefix function '\w+' '.' '[^ ]'{≢⍺⎕S⍬⊢⍵}¨⊂ Try it online! '\w+' '.' '[^ ]'{…}¨⊂ apply the following anonymous lambda on each of the PCRE patt...

posted 3y ago by Adám‭  ·  edited 3y ago by Adám‭

Answer
66%
+2 −0
Challenges Word Count Tool

Ruby, 55 bytes ->a{[a.split,a.tr($/,''),a.gsub(/[ ]/,'')].map &:size} Try it online! split removes all whitespace, but lines doesn't for some reason. Would've been useful in place o...

posted 3y ago by Razetime‭

Answer
66%
+2 −0
Challenges Are they abundant, deficient or perfect?

Japt, 11 bytes Could be 2 bytes shorter if not for a bug in Japt when trying to get the proper divisors of a number. õ üÈgXnXâ x Try it õ üÈgXnXâ x :Implicit input of integer U õ ...

posted 3y ago by Shaggy‭  ·  edited 3y ago by Shaggy‭

Answer
66%
+2 −0
Challenges Merge two strings

Japt -h, 13 12 9 bytes à m+V kbU Try it à m+V kbU :Implicit input of strings U & V à :Combinations of U m :Map +V : Append V k :Filt...

posted 3y ago by Shaggy‭  ·  edited 3y ago by Shaggy‭

Answer
66%
+2 −0
Challenges 1, 2, Fizz, 4, Buzz!

Japt -R, 27 bytes Lõ@"FiBu"ò úz4 ËpXv°EÑÄìªX Test it Lõ@"FiBu"ò úz4 ËpXv°EÑÄìªX L :100 õ :Range [1,L] @ ...

posted 3y ago by Shaggy‭

Answer
66%
+2 −0
Challenges Diagonalized alphabet

Japt -R, 16 bytes This feels far too long for the task at hand - what am I missing?! ;Bó v ¬£14îUiX q Test it ;Bó\nv ¬£14îUiX q ;B :Uppercase alphabet ó ...

posted 3y ago by Shaggy‭  ·  edited 3y ago by Shaggy‭

Answer
66%
+2 −0
Challenges Golf a FRACTRAN interpreter

Japt v2.0a0, 18 bytes The r÷ can be removed if we can take an array of floats instead. T=V£*Xr÷Ãæv1)?ßT:U Try it T=V£*Xr÷Ãæv1)?ßT:U :Implicit input of integer U and 2D-array V T= ...

posted 3y ago by Shaggy‭  ·  edited 3y ago by Shaggy‭

Answer
66%
+2 −0
Challenges Golf a FRACTRAN interpreter

JavaScript, 44 bytes a=>g=n=>a.every(([p,q])=>(x=n*p/q)%1)?n:g(x) Try it online!

posted 3y ago by Shaggy‭

Answer
66%
+2 −0
Meta Questions feed for the Challenges category lacks post links

shouldiblamecaching.com? Yes, yes we should.

posted 3y ago by ArtOfCode‭

Answer