@Mr.Xcoder @Grimy @Emigna @Adnan We don't have a builtin to get all possible combinations of a list, do we? I.e. [1,2,3,4] would return [[1,2,3,4],[1,2,3],[1,2,4],[1,2],[1,3,4],[1,3],[1,4],[1],[2,3,4],[2,3],[2,4],[2],[3,4],[3],[4],[]] (in any order) I'm currently doing 2.Œ€н, but it seems overly long to accomplish this..

@KevinCruijssen Actually we do. The set of all possible combinations of a list is called the powerset of that list and is implemented in 05AB1E: æ

@Mr.Xcoder Ah, the powerset, of course.. Thanks! I knew we should have something like that, but I tried all kind of things (partitions, substrings, b-element combinations, etc.) and forgot about powerset..