dzaima‭

Code golf, being about exploiting things, often brings about many questions about edge cases. Since we don't want each challenge to have to deal with all problems again and again, it makes sense to...

3 answers  ·  posted 5y ago by dzaima‭  ·  last activity 2y ago by Hackysack‭

Don't require example code In general, I believe the decision should be on the challenge creator. Requiring it would be useless for certain types of challenges (kolmogorov-complexity or similar), ...

posted 5y ago by dzaima‭

Challenge Write as many functions, programs, or snippets of code, that result in 256. Your score is the number of separate solutions submitted in an answer. The challenge? The characters used in ...

12 answers  ·  posted 5y ago by dzaima‭  ·  last activity 4y ago by snail_‭

Challenge Output the following text: A ABA ABCBA ABCDCBA ABCDEDCBA ...

13 answers  ·  posted 5y ago by dzaima‭  ·  last activity 5d ago by ojdo‭

The answer header must specify the minimum implementation & environment required If there are multiple implementations of a language and an answer depends on features of one, it must be specif...

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

Canvas, 19 bytes ‾－｛｛╷¹²－ｍ‾－¹－ｍ］ ＊］／ Try it here! ‾-{{╷¹²-m‾-¹-m] *]/ Program, ascii-fied for monospacing ‾- push 28 { ] for 1…28 (pushing counter & s...

posted 5y ago by dzaima‭  ·  edited 5y ago by dzaima‭

Canvas, 17 11 bytes Ｚ２ｎ⤢Ｊ｛×７«ｍＴ Try it here! Z The alphabet 2n split into pairs: ["AB","CD","EF",…] ⤢ transposed: ["ACEGI…","BDFHJ…"] J remove and pu...

posted 5y ago by dzaima‭  ·  edited 5y ago by dzaima‭

BQN, 5 bytes 1+⊒ Try it here! 3 characters, but, as there's no SBCS codepage for BQN, it must be counted as UTF-8. Two of the three characters are just adding one to the built-in that almost ...

posted 5y ago by dzaima‭

SOGL, 10 bytes ╥‰~⅜,(ε ‘ū Try it here! Built-in compression of "hello"; ", "; "world"; "!", with first letters of words uppercased.

posted 5y ago by dzaima‭

Dyalog APL Extended, 14 bytes {¯4⍭4⍭⍣(⍵≤-)2} Try it online! {¯4⍭4⍭⍣(⍵≤-)2} Monadic dfn 2 start with 2 ⍣ Repeat 4⍭ the function "next prime" ...

posted 5y ago by dzaima‭

Challenge Write as many functions, programs, or snippets of code, that result in 256. Your score is the number of separate solutions submitted in an answer. The challenge? The characters used in ...

posted 5y ago by dzaima‭  ·  edited 3y ago by trichoplax‭

Challenge Given a multiline string, list of lines, a character matrix or equivalent, and a description of a line, draw a line made out of either '|' or '-' over it. The given text will consist of...

posted 5y ago by dzaima‭  ·  edited 5y ago by dzaima‭

If there exists something (reasonable) that can run it, it's valid. This includes obscure, non-standards-compliant compilers (though this should be specified in the answer if needed). So any poste...

posted 5y ago by dzaima‭

Canvas, 24 bytes zz＋¹┘％！＊ ‾U｛ŗ３Fi⁸５Bu⁸＋ｎＯ Try it here! Explanation (ASCII-fied for better monospacing): zz+¹┘%!* Helper function ⁸; Expects stack to be [modulo, string] zz+ append "z...

posted 5y ago by dzaima‭

Challenge Output the following text: A ABA ABCBA ABCDCBA ABCDEDCBA ...

posted 5y ago by dzaima‭  ·  edited 3y ago by trichoplax‭