...as long as you don't hit the recursion limit (not in this kata)

Both list comprehension and RE is O(n) in this case.

Kata's naming is overcomplicated i guess. There is standart names for variables in Physics.

How this can be a BP. No readability, do not follow pip8 recs.

i think about mapping, but dont know there is all function in py, greate and readable

greate use of lambdas and recursion

https://www.geeksforgeeks.org/python-list-comprehensions-vs-generator-expressions/

number of pillars (≥ 1) is given to us. We have no need to check it in our code

This one should be BP.
Remember, you can use \d instead 0-9 and there is fullmatch() function, in this case fullmatch makes code more readeable, bc we have less regex code (which is not for reading, write-only code)

Bc If zero or more characters at the beginning of string match the regular expression pattern, return a corresponding match object. Return None if the string does not match the pattern; note that this is different from a zero-length match. So, u get a RE object or None, but we need a bool type as an answer.
You can read more here: https://docs.python.org/3/library/re.html

this one shoud be BP. This solution is not a oneliner, but this is O(1), while others have O(N)

Best one. List comprehension needs more time and resource. for s in '1234567890' iterates through the array multiple times, sub needs only one iteration to complete the task.

Bc creatin new array is more time and resource consuming. Using regex is BP for this case. My advise for everyone: learn what is regix (import re) and how to use it