Desmos, 96 bytes n=L.length S=[total(floor(mod(i/2^{[0...n]},2))L)fori=[0...2^n-1]].sort f(L)=S[S[2...]=S].unique Try it on Desmos! How it works Conceptually similar to Steffan's Vyxal solution but lacks builtins :) S=[total(floor(mod(i/2^{[0...n]},2))L)fori=[0...2^n-1]].sort for i=[0...2^n-1] ...

The Narrative You are a frog who is at the edge of a pond with waterlilies. You would like to cross the pond without getting wet, so you plan to jump from lily to lily. There is, however, one problem: you are a rare species of frog which can only jump one specific distance, and so you might not b...

Eh, codegolf shmodegolf This is a very unbaked idea about implementing Shm-reduplication, originating in Yiddish, where one takes a word, duplicates it, and replaces the first syllable in the second word with "Shm" in order to indicate that one does not care. Some examples include: Word -> Word ...

Reverse hex cipher code-golfstring Characters in strings are sometimes represented as their ASCII hexadecimal codes. Printable characters have two hex digits in their representation. Swapping those digits leads to another character, which will be our output. The table of relevant character codes...

Hello everyone, I need someone who can figure out a solution for this. Who can reduce that line of numbers (0 and 1) shortly as possible, and then reverse the change to get back the original line. This was the hardest question that my teacher give. ex: 11110000 > 4*1.0