Search
Python 3, 7 distinct characters, 11 bytes True/-~True Try it online!
J, 4 3 distinct, 6 bytes -:_-:_ Half of _ -: _ which is asks if infinity matches infinity. Thanks to @xash in the APL farm discord for saving the 3 unique bytes and orthoplex for catching my bl...
Perl, 3 distinct, 12 bytes s//yy//y/y// Try it online! Prepends yy to the start of $_, and then transliterates them, dividing the count of each.
Clojure - 15 characters total, 5 unique Inspired by the Embed ESCR solution above, I realized I could do something very similar in Clojure: (/(*)(+(*)(*))) This returns 1/2, which is a Ratio i...
Python 3, 5 unique bytes, 28 total (()==())/((()==())+(()==())) (, ), =, /, + Uses (()==()) to get True with only 3 unique characters, as well as making the later grouping of (...+...) free. ...
Challenge It's a bootstrapping challenge this time! Write a full program that, once run, writes the source code of another program that in turn, once run, writes the source code for another progra...
Challenge Given an array in any suitable format, create a frequency table for it. i.e: Pair each unique element with the number of times it appears in the array. You can return the frequency tabl...
Vyxal, 4 bytes ‡∑Ḋȯ Try it Online! Explained ‡∑Ḋȯ ‡ ȯ # Find the first input numbers where: ∑ # The sum Ḋ # Divides that number
Vyxal, 5 4 bytes ¤{‹… Try it Online! This is so stupid and I love it Explained ¤{‹… ¤ # Push an empty string { # Forever: ‹ # Append a "-" to the top of the stack … # ...
I see the Sandbox as a vital part of challenge design. When I visit the Sandbox I'd like to be able to show only proposals that are not finalized, so I can focus feedback where it is needed. In th...
Python, 45 bytes I am not a Python guy at all, so I'm quite proud of this. I'm sure, though, there's something simple I could be doing to save myself a few bytes! lambda n:int(n,int(max("1"+n),...
BQN, 32 bytesSBCS Run online! {∨´∾8(⥊(⊐⌾⥊𝕩)⍷·≠⌜˜2|/∘⥊)¨1+↕≠⥊𝕩} Brute force: tests against all boards up to the number of characters in 𝕩 using Find (⍷). Using the longest dimension is faster b...
Recently a flag came to my attention on this post: https://codegolf.codidact.com/posts/280372/281943#answer-281943 It is a well-intentioned answer to the challenge, but unfortunately it is wrong, ...
When posting a fastest-code challenge, what do I need to bear in mind? Unlike with code-golf challenges, where the score is simply the number of bytes in the source code, for a fastest-code challe...
If restricting everyone to the same system, then we can force every contestant to use https://tio.run and the on-site bench-marking found below "debug" -> "real time" as efficiency metric. Examp...
Python 3, 35 bytes lambda x:[chr(ord(i)|32)for i in x] Try it online! Performs a list comprehension on the input string; for each character it: transforms it into the ASCII character code...
Vyxal, 3 bytes ∩ṘR Try it Online! Transpose, reverse, reverse each.
Vyxal, 12 bytes µ«,←⋎„¶ɽ₌Ż«ḟ Try it Online! Outputs as a list of characters. Sort by index in (compressed) tibdfghklpqyj.
Given a hinged tetromino, give it a unique, consistent label independent of location, rotation, and reflection. Tetrominoes A tetromino is a connected subset of the square tiling, composed of 4 s...
