@Adnan @Mr.Xcoder @Emigna Is there a way to split a list into pieces of size x based on another list? I.e. [1,2,3,4,5,6,7,9,11,13,15,30,45,50,60,70,80,90,91,93] and [7,4,2,5,2] to [[1,2,3,4,5,6,7],[9,11,13,15],[30,45],[50,60,70,80,90],[91,93]]?
I guess .œʒ€g²Q} should theoretically work, but it times out in TIO.. Any shorter and/or more efficient way?
Picked the wrong challenge to test the new recursive function, since the existing answer is 1 byte shorter. xD Existing answer: 2sFD<*> ; my recursive answer 2λλP>}sè. I now better understand how the recursive function works though, so definitely worth trying. Next time I will pick a challenge where it would be shorter than an existing answer. ;p
This challenge was a lot harder than expected.. https://codegolf.stackexchange.com/a/171314/52210
Doesn't seem to work as is in the new version. The head and tail part in the "to" mapping seems to be the (first) problem/differences in comparison to the legacy version.
