south‭

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...

posted 3y ago by south‭  ·  edited 3y ago by south‭

Ruby 3.1.0, 274 259 249 bytes -10 bytes thanks to Paradox in the Ruby discord BEGIN{END{alias module class begin rescue retry ensure end if self elsif defined? for$.in true do super while f...

posted 3y ago by south‭  ·  edited 2y ago by south‭

MATL, 16 bytes 1`1yh1$lZctDwQt] Try it online! The TIO output fetch will likely fail, so make sure to click the run button to stop the execution. 1`1yh1$lZctDwQt] 1` ] - Push 1 o...

posted 3y ago by south‭

Ruby, 33 bytes ->n,m{[*(0...n*m).each_slice(m)]} Try it online!

posted 3y ago by south‭

Fig, 3 bytes Actual score is: $3\log_{256}(96)\approx$ 2.469 bytes. Filters consonants from the input string using implicit input. Fcb Try it online! Fcb F : Filter with two string args fi...

posted 2y ago by south‭

J, 15 bytes 7 u:32 OR 3 u:] Port of Shaggy's answers. Evaluates as 3 forks 7 u: (32 OR (3 u:])) Attempt This Online! 7 u:32 OR 3 u:] ] : right argument 3 u: : 3&a...

posted 2y ago by south‭

MATL, 3 distinct, 3 total lH/ Try it online! Computes 1/2. Reserved labels for constants can be found here

posted 3y ago by south‭

MATL, 6 bytes YftuX= Try it online! Same method as Moshi. YftuX= Yf - factor with implicit input t - duplicate u - unique X= - isequal

posted 3y ago by south‭

J, 28 bytes [:}.@{.m&(+/ .*)&m=.2 1,:1 0 Try it online! Tacit matmul solve. x&u&y applies x to y n times.

posted 3y ago by south‭

Python 3, 38 36 33 bytes lambda x:{n:x.count(n)for n in x} -2 bytes thanks to @Razetime Another -3 bytes thanks to @orthoplex Attempt it online!

posted 3y ago by south‭  ·  edited 3y ago by south‭

J, 9 bytes 1#.]=&><\ This is the 7 byte APL solve but makes use of #. in place of +/"1. I came up with 1#.]=[\ first, but bubbler pointed out it breaks when non zeros are present. At...

posted 3y ago by south‭

Myby, 12 5 bytes primf=primfd primf : prime factors = : equals primfd : unique prime factors Evaluated as a monadic fork in J (f y) g (h y). The test cases (retest...

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

Sidef, 25 bytes {eval .split.join(" * ")} {eval .split.join(" * ")} { } # Create anonymous code block .split.join(" * ") # splits on whitespace and joins with "...

posted 2y ago by south‭

Fig, 5 bytes The actual score is $5\log_{256}(96)\approx$ 4.116 bytes. The leaderboard only likes ints in the header. (J,Q0 -1 char thanks to Seggan Try it online! Fractional byte lang creat...

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

Fig, 2 unique, 2 total H! Try it online! Halves the negation of the empty string when no input is given.

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