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
 
50%
+0 −0
Challenges "Hello, World!"

C (gcc), 46 bytes printf(char*);main(){printf("Hello, World!");} printf(char*);(14 bytes) is better than #include <stdio.h>\n(19 bytes)

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

Answer
50%
+0 −0
Challenges Determine whether an integer is square-free

JavaScript, 31 bytes Outputs 0 for falsey and a non-zero value for truthy. If the 2 values must be consistent then replace the last * with && to output true instead. n=>(g=d=>d++&...

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

Answer
50%
+0 −0
Sandbox 3D compass point from 3D coordinates

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

50%
+0 −0
Challenges Rationalise recurring binary

Given a potentially recurring binary string, output the number it represents, as a fraction in lowest terms. The notation used in this challenge for recurring digits is non-standard. An r is used ...

0 answers  ·  posted 2y ago by trichoplax‭  ·  edited 5mo ago by trichoplax‭

50%
+0 −0
Sandbox Balanced quinary quasiquine [FINALIZED]

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

50%
+0 −0
Sandbox Knight safe squares [FINALIZED]

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

50%
+0 −0
Sandbox Holeyest base representation [FINALIZED]

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

50%
+0 −0
50%
+0 −0
50%
+0 −0
Challenges The holeyest base

Ruby, 77 bytes ->x{(2..16).max_by{x.to_s(_1).chars.sum{|y|"".bytes[y.hex]}}} Attempt This Online!

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

Answer
50%
+0 −0
Sandbox Connect the corners without 4 in a row [FINALIZED]

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

50%
+0 −0
Sandbox Sort letters by height [FINALIZED]

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

50%
+0 −0
Sandbox Circle of text characters [FINALIZED]

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

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 2y ago by trichoplax‭  ·  edited 2y ago by trichoplax‭

Question code-golf string
50%
+0 −0
Q&A Tips for [fastest-code] in Python

If you're not required to use the standard cpython implementation of python, you can usually get a significant speed increase by running your code with PyPy.

posted 2y ago by trichoplax‭

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

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

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

posted 2y ago by trichoplax‭  ·  edited 2y 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 2y ago by trichoplax‭

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 2y ago by Shaggy‭  ·  edited 2y ago by Shaggy‭

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

posted 2y ago by trichoplax‭  ·  edited 2y 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 2y ago by south‭  ·  edited 2y ago by south‭

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 2y ago by Moshi‭

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 2y ago by Shaggy‭  ·  edited 2y ago by Shaggy‭

Answer