in KDB/Q, how do I generate all combinations given an alphabet universe (doesn't have to be string, could be like a list of numbers) for a given size n?
What I am looking for is similar to this in python, but in q. How to generate all possible strings in python?