@Mr.Xcoder @Emigna @Adnan What would be the easiest way to split a (sorted) list into sublists which are strictly increasing by 1? For example: [12,13,14,15,20,21,34,35,36] would become [[12,13,14,15],[20,21],[34,35,36]]. I can't get a clear head and think of something short to accomplish this.. I end up at 15+ bytes, and have the feeling it can be done in like 5 or 6.. >.>

Hi, trying rn.

@KevinCruijssen this might work. Haven't really tested.

@Emigna Ah, that indeed works pretty well.

@Emigna @KevinCruijssen Given a list and a list of lengths, what is the shortest way to split the list into chunks of those length? ex: [1,2,3,4,5,6,7,8], [2,2,4]->[[1,2],[3,4],[5,6,7,8]]?

£

Great

Whoops, that was dumb

:)

@Emigna @KevinCruijssen Does this one work for 6?

(Haven't really tested yet)

@Mr.Xcoder Ooh, nice use of ā. Looks okay on my test case at least

I wish āαγ£ worked.

Because it currently errors, shame :(

Not sure I feel like it should give the same result as āαγ€g£ though.

Though I don't really see what other useful result it could give

possibly a vectorization of regular £

Oh, nice @Mr.Xcoder

Hmm, I wish there was a 1-byte builtin for €g, I use it all the time..

Thanks for the help! I will post an answer soon, and then you can give tips to golf the rest, because it's overly long.. xD