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
 
60%
+1 −0
Challenges Balanced quinary quasiquine

Given an integer $N$ in balanced quinary, output the first $N$ characters of your source code if $N$ is positive, or the last $-N$ characters of your source code if $N$ is negative. Terminology ...

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

Question code-golf quine base
60%
+1 −0
Challenges 55 fruit salad: choose your own Kolmogorov complexity

Japt, 233 bytes `ÜÊ Ò˜ Í a×G ¯¯o ÖÚb ¯ØÚ ז »Ûá ÝÁ„ Á²g fig ¤¶n ÓI„ lªo §Ö‡ ÚAo Ú-n Û u Ûo nÂ) šem ÇÓy pe‡ pi¦ Îñˆ ΰn Ѧk Ѧl sŽb Ɏ ȃp Èîp ÈlŸ ‘y °ÛG Ù i abiu alڈ app¤ ‡aza bael b„„a ¼ÚAe ÞÃ...

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

Answer
60%
+1 −0
Challenges Hex ​​​detector

Given an integer from 1 to 1000, indicate whether it is a centered hexagonal number[1] (also known as a hex number). What is a hex number? The hex numbers can be visualised as follows: On a he...

4 answers  ·  posted 12mo ago by trichoplax‭  ·  last activity 10mo ago by trichoplax‭

Question code-golf math number
60%
+1 −0
Challenges Most isolated of 3 points

Given 3 points, output one that is separated from its nearest neighbour by the largest distance. Input 3 distinct points (that is, no 2 points are in the same position). Each point is a pair o...

0 answers  ·  posted 12mo ago by trichoplax‭  ·  edited 12mo ago by trichoplax‭

Question code-golf math number
60%
+1 −0
Sandbox Most isolated of 3 points [FINALIZED]

posted 12mo ago by trichoplax‭  ·  edited 12mo ago by trichoplax‭

60%
+1 −0
Challenges The 50 substrings that validate any string of Roman numerals

Haskell, 271 bytes import Data.Char import Data.List n=" IVXLCDM" r x=maximum[if(s`isInfixOf`x)then s else"A"|s<-words$concat$map(\x->(n!!div x 8):[(n!!(x-8*(div x 8)))])$map(\x->ord...

posted 1y ago by Arpad Horvath‭

Answer
60%
+1 −0
Challenges Hex ​​​detector

Japt -d, 8 bytes °*U*3¥NÉ Try it 9 bytes NøT±1wU*6 Try it

posted 12mo ago by Shaggy‭  ·  edited 10mo ago by Shaggy‭

Answer
60%
+1 −0
Challenges The 50 substrings that validate any string of Roman numerals

Bash, 205 bytes for s in C{C{CC,D,M},DC,MC} {CM,DC,D}{D,M} I{C,D,I{II,V,X},L,M,VI,X{C,I,L,V,X}} L{C,D,L,M,XC,XL} MMMM V{C,D,IV,IX,L,M,V,X} X{C{C,D,L,M,X},D,LX,M,X{C,L,XX}} do echo $1|grep -q $s...

posted 12mo ago by celtschk‭

Answer
60%
+1 −0
Meta Short ​​​titles

A limit of 1 character for Challenges and Sandbox Now that Monica has pointed out that adjusting the minimum is already possible per category, I propose that we leave the minimum at 15 characters ...

posted 12mo ago by trichoplax‭  ·  edited 12mo ago by trichoplax‭

Answer
60%
+1 −0
Challenges Hex ​​​detector

Dyalog APL, 10 bytes ⊢∊1+\⍤,6×⍳ Port of lyxal's Vyxal answer. Explanation ⊢∊1+\⍤,6×⍳­⁡​‎‎⁡⁠⁡‏⁠‎⁡⁠⁢‏‏​⁡⁠⁡‌⁢​‎⁠⁠‎⁡⁠⁤‏⁠‎⁡⁠⁢⁡‏⁠‎⁡⁠⁢⁢‏⁠‏​⁡⁠⁡‌⁣​‎‎⁡⁠⁣‏⁠‎⁡⁠⁢⁣‏‏​⁡⁠⁡‌...

posted 12mo ago by RubenVerg‭

Answer
60%
+1 −0
Meta How do we handle standardizing things?

Something I would like to see here are explicit and specific constraints on how submitted solutions are expected to accept the challenge input and output their solutions (if output is the goal). F...

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

Answer
60%
+1 −0
Challenges Make $2 + 2 = 5$

AWK, 28 26 21 bytes $0=$1~2&&$2~2?5:$1+$2 Try it online!

posted 1y ago by xrs‭  ·  edited 7mo ago by xrs‭

Answer
60%
+1 −0
Challenges The 50 substrings that validate any string of Roman numerals

Rust, 258 254 bytes Saved four bytes thanks to trichoplax. fn v(s:&str)->&str{for b in "CCCC CCD CCM CDC CMC CMD CMM DCD DCM DD DM IC ID IIII IIV IIX IL IM IVI I...

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

Answer
60%
+1 −0
Challenges Single digit Roman numeral

AWK, 80 bytes {split("I V X L C D M 1 5 10 50 100 500 1000",d);for(;d[++i]!=$1;);print d[i+7]} Try it online! A quick map function. 'split' breaks the string into array elements. Find the stri...

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

Answer
60%
+1 −0
Challenges "Hello, World!"

C (gcc), 30 bytes main(){puts("Hello, World!");} Try it online! This is using GNU C extensions. GNU C allows main() over int main(), ss well as using puts without including stdio.h.

posted 1y ago by Lundin‭

Answer
60%
+1 −0
Challenges Looping counter

K (oK), 9 bytes {x#0}'!10 Try it online! !10 / pass range your arbitrary number .' / treat those as a list, and evaluate each separately { } / main function...

posted 1y ago by xrs‭  ·  edited 10mo ago by xrs‭

Answer
60%
+1 −0
Challenges Digit Sum Integer Sequence (working title)

AWK, 82 bytes {split($1,d,"");i=a=d[1];for(x in d){d[x]>a?a=d[x]:0;d[x]<i?i=d[x]:0}print a+i+$1} Try it online! Just pass your input, e.g.: echo "123" | awk '...'

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

Answer
60%
+1 −0
Challenges "Hello, World!"

Emmental, 51 bytes #72.#101.#108::..#111:.#44.#32.#87..#114..#100.#33. Try it online! Basically what goes on is #[num] pushes the ASCII value of num onto the top of the stack, : duplicates t...

posted 3mo ago by CrSb0001‭

Answer
60%
+1 −0
Challenges Digit balanced numbers

Python 3, 43 bytes lambda n:len({*map(str(n).count,str(n))})<2 Try it online!

posted 3mo ago by m90‭

Answer
60%
+1 −0
Challenges Ratio limits of fibonacci-like series

Python 3, 26 bytes lambda n:(n+(n*n+4)**.5)/2 We can actually just compute this directly, although I could have taken an alternate path considering the fact that, given $R_n$ as the ratio betwe...

posted 2mo ago by CrSb0001‭  ·  edited 15d ago by CrSb0001‭

Answer
60%
+1 −0
Challenges Give the fool's fibonacci sequence

Python 3, 131 75 62 bytes f=lambda n:n>0and 2+3*f(n-1)+4*f(n-2)+2*sum(map(f,range(n-2))) I know, a one-liner is boring. This is because I apparently didn't need a separate function/lambda to...

posted 2mo ago by CrSb0001‭  ·  edited 2mo ago by CrSb0001‭

Answer
60%
+1 −0
Meta Should we delete the code-golf-tips tag?

The code-golf-tips tag seems redundant since we already have code-golf and tips. It also has zero usages. Should this tag be deleted to avoid its future usage?

1 answer  ·  posted 2mo ago by trichoplax‭  ·  last activity 2mo ago by trichoplax‭

Question discussion tags
60%
+1 −0
Q&A Rust golfing tips

What tips do you have for saving bytes in Rust? Please post one tip per answer for ease of voting and commenting.

3 answers  ·  posted 2mo ago by trichoplax‭  ·  edited 2mo ago by trichoplax‭

Question code-golf tips
60%
+1 −0
Q&A Rust golfing tips

Avoid type annotations with a closure instead of a fn Function (24 bytes) A function requires types to be specified for its return value, and for any arguments it takes. fn f(a:u8,b:u8)->u8{a...

posted 2mo ago by trichoplax‭

Answer
60%
+1 −0
Challenges Digit balanced numbers

Japt -g!, 5 bytes ü üÊÅ Try it ü üÊÅ :Implicit input of string/array ü :Group & sort by value ü :Group & sort by Ê : Length Å :Slice off the fi...

posted 2mo ago by Shaggy‭

Answer