What is fastest solution to flatten lists which contain other lists of arbitrary length?
For example [1, 2, [3, 4, [5],[]], [6]] would become [1,2,3,4,5,6].
There can be arbitrarily many levels. Some of the list objects can be strings, which mustn’t be flattened into their sequential characters in the output list.
Here’s a recursive approach that is string friendly:
returns:
Note, this doesn’t make any guarantees for speed or overhead use, but illustrates a recursive solution that hopefully will be helpful.