Optimizing a stack holding N items to meet as many permutations of strings

Question

I want to find an algorithm that does the following:

I have a list permutations

Each one holds between 1 to 4 strings (repetition is allowed)

Same strin