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.5k posts
 
50%
+0 −0
Challenges It's Hip to be Square

Embed ESCR, 28 characters [= [exp [rnd [sqrt n]] 2] n] The number to test is in N. There are 4 nested functions. From inner to outer: SQRT takes the square root of N. This produces a floating ...

posted 2y ago by Olin Lathrop‭  ·  edited 2y ago by Olin Lathrop‭

Answer
50%
+0 −0
Challenges A number adder, not a death adder

J, 21 bytes ,&'+".1!:1(3)'1!:1(3) Try it online! STDIN is ugly in J because you have to use foreigns.

posted 2y ago by south‭

Answer
50%
+0 −0
Challenges A number adder, not a death adder

ESCR, 35 bytes show "show [+ [arg 1] " [arg 1] "]" The SHOW command writes to standard output. The parameters in quotes are just fixed strings. The ARG function returns a numbered argument. In...

posted 2y ago by Olin Lathrop‭

Answer
50%
+0 −0
Challenges Solve Goldbach's Conjecture

J, 50 bytes {{({~[:y&(i.&1@:=)[:>+/&.>),{@(,&<)~p:i.p:^:_1 y}} Try it online! A nasty DD solution. {{({~[:y&(i.&1@:=)[:>+/&.>),{@(,&<)~p:i.p:...

posted 2y ago by south‭

Answer
50%
+0 −0
Challenges Solve Goldbach's Conjecture

Ruby, 69 bytes require'prime';->n{Prime.first(n).then{_1.product _1}.find{_1+_2==n}} Try it online!

posted 2y ago by south‭

Answer
50%
+0 −0
Challenges Solve Goldbach's Conjecture

Python 3.8, 112 bytes def f(x):y=[i for i in range(2,x)if not[j for j in range(2,i)if i%j<1]];return[(q,x-q)for q in y if x-q in y][0] Try it online!

posted 2y ago by dino‭

Answer
50%
+0 −0
Challenges Solve Goldbach's Conjecture

Ruby, 62 bytes require'prime';f=->n,k=0{n.prime?&&k.prime?? [n,k]:f[n-1,k+1]} Attempt This Online!

posted 2y ago by radarek‭

Answer
50%
+0 −0
Challenges Are All Elements Equal?

MATL, 4 bytes tPX= Try it online! tPX= t - duplicate with implicit input P - fliplr in MATLAB, reverses top of stack X= - isequal

posted 2y ago by south‭

Answer
50%
+0 −0
Challenges Solve Goldbach's Conjecture

MATL, 19 bytes XH:YqtZ*!tsH=f1Z)Z) Try it online! I'm still a novice at MATL, so I am all ears to any improvements. XH:YqtZ*!tsH=f1Z)Z) XH - copy implicit input to H clipboa...

posted 2y ago by south‭

Answer
50%
+0 −0
Challenges "Hello, World!"

SOS, 155 Bytes !+!-!!+!-!!!!+!!-!!+!-!+!-!+!!-!+!!-!!!+!!-!+!!-!!!+!!-!+!!!!-!!+!-!+!!-!!!!+!-!!!!!!+!-!+!-!+!!!-!+!!-!+!!!!-!+!!!-!!+!-!!+!!-!+!!-!!!+!!-!!+!-!!+!-!!!!+! Explanation: Each ! o...

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

Answer
50%
+0 −0
Challenges Reverse an ASCII string

SOS, 76 bytes +>+>?<+>?<+>?<+>?<+>?<+>?<+>?<+>?<<)<<-(>{>!<{>!<{>!<{>!<{>!<{>!<{>!<{>!&l...

posted 2y ago by celtschk‭

Answer
50%
+0 −0
Challenges Write a Deadfish Interpreter

JavaScript (V8), 78 bytes f=s=>s.map(c=>(_==256||_<0?_=0:0)||c=='i'?_++:c=='d'?_--:c=='s'?_*=_:v+=_+' ') Try it online!

posted 2y ago by Zakk‭  ·  edited 2y ago by Zakk‭

Answer
50%
+0 −0
Challenges The Pell Numbers

Lua 5.4.4, 51 bytes function f(n)return n<2 and n or f(n-1)*2+f(n-2)end Try it online!

posted 2y ago by Zakk‭

Answer
50%
+0 −0
Challenges The Pell Numbers

C (gcc), 35 bytes f(n){return n<2?n:f(n-1)*2+f(n-2);} Try it online!

posted 2y ago by Zakk‭  ·  edited 2y ago by Zakk‭

Answer
50%
+0 −0
Challenges Mediocre pop count

JavaScript, 104 102 99 bytes I/O as a character array. a=>a.filter(x=>a<g(x)&g(x)<a[~-a.length],a=a.map(g=x=>[...Buffer(x)[0].toString(2)].sort()).sort()) Try it online!

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

Answer
50%
+0 −0
Challenges Circle of text characters

Given a radius R, output a text representation of a circle. Input A positive integer R (strictly greater than zero) You do not need to handle values of R greater than 32 Output A square ...

0 answers  ·  posted 1y ago by trichoplax‭  ·  edited 1y ago by trichoplax‭

Question code-golf string
50%
+0 −0
Sandbox Sort letters by height [FINALIZED]

posted 1y ago by trichoplax‭  ·  edited 1y ago by trichoplax‭

50%
+0 −0
Meta Thoughts on hiding challenge sections with expandable details tags

Since the examples I've given in the question are deliberately brief, they don't demonstrate the benefit of hiding a large block of text. I'm giving an example in this answer of one of my own chall...

posted 1y ago by trichoplax‭

Answer
50%
+0 −0
Sandbox Pinwheel ​words [FINALIZED]

posted 1y ago by trichoplax‭  ·  edited 1y ago by trichoplax‭

50%
+0 −0
Challenges "Hello, {name}!"

Factor, 30 29 bytes [ readln "Hello, %s!"printf ] Try it online! Uses io and formatting.

posted 1y ago by south‭  ·  edited 1y ago by south‭

Answer
50%
+0 −0
Challenges Lowercase, but not just the letters

JavaScript, 52 51 28 bytes s=>Buffer(s).map(x=>x|32)+`` Try it online! -1 byte thanks to trichoplax‭.

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

Answer
50%
+0 −0
Challenges Mediocre pop count

Python, 89 bytes lambda l,g=lambda c:ord(c).bit_count():[i for i in l if min(map(g,l))<g(i)<max(map(g,l))] Attempt This Online!

posted 1y ago by Moshi‭

Answer
50%
+0 −0
50%
+0 −0
Sandbox Mediocre pop count [FINALIZED]

posted 1y ago by trichoplax‭  ·  edited 1y ago by trichoplax‭

50%
+0 −0
Sandbox Just the vowels please [FINALIZED]

posted 1y ago by trichoplax‭  ·  edited 1y ago by trichoplax‭