Search Results

Husk, 6 bytes ḟoΛ≤d→ Try it online! Explanation ḟoΛ≤d→ ḟ find the first integer → starting from input incremented o such that composed function Λ d every digit ≤ is less t …

Husk, 8 7 bytes #ȯ¬%2ΣQ Try it online! Explanation Q # consecutive subsequences # # count elements by ȯ # composed function ¬ # not Σ # sum %2 # mod 2 -1 byt …

Ruby, 45 bytes f=->n,d{n==0?"":n/d<0??g+f[-d,n]:?f+f[n-d,d]} Try it online! Use as f[n,d] basically a port of loopy walt's python answer

Husk, 4 bytes Σṁdḣ Try it online! ḣ makes a range from 1 to input ṁd flatmap digits Σ sum

Perl 5, -p 30 bytes $_=sprintf"%08b ",hex;y/01/ X/ Pretty much identical to Jordan's Ruby answer Try it online!

sed 4.2.2, -E 178 141 bytes s/./&FEDCBA9876543210:/g s/(\w)\w*\1//g s/\w/ /g s/ +/&&&&/ s/ +/&&&&/ s/:// : s/^(.+)\1:/\1: / s/^ (.*)\1:/\1:X/ t s/:// :z s/^.{,7}$/ &/ tz Takes newline-separated input …

Husk, 5 bytes Ṙ2Ċ2t Try it online! Explanation Ṙ2Ċ2t t drop first char Ċ2 take every 2-nd char Ṙ2 repeat each char 2 times

Ruby, 98 87 bytes p`dd`.gsub(/\d+-/,'*\00..').split(?/).flat_map{|x|eval"[%s].product([%s])"%x.split(?:)} Try it online! Explanation `dd`.gsub(/\d+-/,'*\00..') # input and replace "nu …

Husk, 34 31 28 bytes mȯötm!"X "ḋ+256B16m€f□…"1F"w Try it online! Takes input as a space-separated argument Husk is missing some useful functions such as pad and hex which makes this answer so long, o …

Husk, 6 bytes OumΠπ2 Try it online! Explanation OumΠπ2 π2 cartesian square mΠ map product u unique O sort

Husk, 4 bytes ▼m▲X Try it online! Explanation ▼m▲X X each consecutive slice of length m▲ maximum of each ▼ minimum

Husk, 4 bytes * 0.5 = 2 Σ↔ḣṫ Try it online! Explanation Σ↔ḣṫ ṫ range from input to 1, [5,4,3,2,1] ḣ prefixes, [[5],[5,4],[5,4,3]...] ↔ reverse, [[5,4,3,2,1],[5,4,3,2]...] Σ c …

Ruby, 54 bytes ->a{(1..).find{|i|!a.flat_map{i.digits(_1)|[]}.uniq!}} Try it online! (with modifications to work on older versions)

Husk, 14 13 bytes -1 byte thanks to Dominic van Essen ◄§-▼▲fo=▲¹Σπ3 Try it online! Explanation ◄§-▼▲fo=▲¹Σπ3 π3 cartesian product of 3 * input fo filter by composed funct …

Husk, 8 bytes ÖoΣḋŀ`^2 Try it online! `^2 flip ^, partially applied, gets fully applied with implicit input, 2 ^ n ŀ range from [0, n) Ö sort by o composed function Σ …