Ginger Industries
• Member for 2 months
• Last seen this week
• The Far End of the World

APOL, 38 bytes Port of Joeph Walker's genius answer, all credit goes to him. ḟ(10 18 v(0 ∋) ḟ(1 9 p(*(18 +(∋ ⁰))))) Sadly, APOL doesn't support nested for counters, so I have to use a clunkier ...

KonamiCode, 12 bytes ^^vv<><>BALS If this seems cheaty to you, here's another one that actually does the work (168 bytes): v(^^^^^^^>^^)<<v(^>>^)<<v(^>>^^^^^^^^)&...

APOL, 46 27 bytes I(j(ƒ(i %(%(↶(∋) 92) 12)))) Uses Arnauld's 92/12 solution. Note: 3 bytes can be saved by removing the I instruction, however this version is not case 5-compliant. Explanation I( ...

KonamiCode, 111 109 bytes >>>>(^^)v(>)>(^)v(>)L(>)>(^)v((>))>(^^)S(^)A(^^)v(^)A(^>)L(^^)v(>)B(^^^)L(^^^)L(^>)>(>)S((^))>(^)B(>)>(^^)<<<...

Python 3, 69 64 61 55 bytes Takes a list of floats as input. lambda l:sum(o*-~c*(len(l)-c)for c,o in enumerate(l)) My original code (because the above is quite confusing): lambda l:sum(float(o)*c*(...

APOL, 70 bytes (Easy) ƒ(56 ¿(%(I(I(∈ )) 4) ¿(F :(33:3():33::()) ¿(F 2 ¿(≐(∈) 2 3))))((X)) ) The cracked output is: [None, 2, 2, 2, None, 2, 2, 2, None, 2, 2, 2, None, 2, 2, 2, None, 2, 2, 2, None, 2,...

APOL, 19 bytes w(T p(∈) p(-(0 ∈))) Pretty self-explanatory.

APOL, 35 bytes j(ƒ(i ¿(&(c(Ⓔ ↓(∋)) ≐(∈)) ∋ ↑(∋)))) Explanation j( Join a list to a string ƒ( Listbuilder for i Input ¿( Returning if (called for each item in the input) &( ...

Medium Note: I had to update the images due to a problem with the encoder, be sure to redownload them if needed Image 1: explore the universe Image 2: no transparency? Image 3: Hint 1:

APOL, 51 bytes v(0 +(⧣ 1));w(|(!(%(⁰ 3)) c(t(⁰) '3')) ∆(0));-(⁰ 1)

APOL, 21 bytes ⅎ(9 p(*(t(∈) ∈)))

APOL, 49 bytes v(0 1);v(1 i);w(⊕(ƒ(s(¹) %(⁰ I(∋)))) ∆(0));-(⁰ 1) This could almost certaintly be made shorter, maybe I'll come back to it later.

Medium difficulty Image 1: hello world Image 2: llama with wheels Image 3:

APOL, 23 bytes ƒ(s(i) j(ƒ(∋ V(⋒ ∈))))) Explanation ƒ( List-builder for loop s( String-split instruction (splits at spaces by default) i Input ) j( String join ...

APOL, 39 bytes +("Min" +(¿(!(∿(õ)) "ce" "ec") "raft"))

Python 3, 63 62 bytes lambda n: int("".join([str("⁰¹²³⁴⁵⁶⁷⁸⁹".index(c))for c in n])) Thanks @Fmbalbuena!

KonamiCode, 17 bytes v(^^^^^^>^^^^^)<<

KonamiCode, 54 50 55 bytes v(>)>(^)v(^^^>^^)S(^>>^)>(>)L(>)<<<v((>))>(^)<<>(>)B(>) A version with an explanation: [You actually do need to ...

APOL, 23 bytes !(x(ƒ(i %(↶(∋) l(⋒))))) Explanation: !( Not x( Any list item is true ƒ( List-builder for i Input %( Modulo ↶( ASCII ...

APOL, 33 bytes j(ƒ(i ¿(!(I(∋)) ¿(≐(∈) 0 '') 1))) Explanation: j( Join list to string ƒ( List-builder for i Get input ¿( Returning if !( Not ...

APOL, 79 bytes This could almost certaintly be made shorter. v(0 i);j(ƒ(R(⁰ "re" "*") ¿(=(∋ "*") +(" " *("r" -(l(⁰) 2))) *("o" l(⁰)))) "...

APOL, 32 bytes ⊕(⭳(ƒ(i ƒ(Ŀ(t(↶(∋))) I(b(∋)))))) Explanation ⊕( Sum (totals all items in a list) ⭳( List flatten (Turns 2d lists into 1d lists) ƒ( List-...

APOL, 34 16 bytes My original version was written back when I first made APOL and used none of the newer convenience instructions. ¿(⧣ w(T p(1)) 0) Explanation ¿( Returning if ⧣ ...

APOL, 8 bytes ¿(⧣ ⋔ 1) Explanation ¿( Returning if statement ⧣ Integer input (condition, 0 evaluates to false) ⋔ If item (returns the value of the condition, executed if true) 1 A ...

APOL, 14 bytes ⅎ(ⓛ p(*(∋ ∈))) Explanation: ⅎ( 1-indexed for (f is 0-indexed) ⓛ The built-in lowercase ascii letters constant p( Print *( Multiply ∋ Current item in ...

APOL, 32 bytes +("Hi " +(V(i 4) ", I'm APOL!"))

APOL, 7 bytes w(!(i)) This simply repeats until i returns a non-empty string.

APOL, 33 bytes v(0);f(i ∆(0 +(⌕(ⓛ ∋) 1)));=(⁰ ô)