Re^2: How can one get all possible combinations of a string without changing positions & using window size?

in reply to Re: How can one get all possible combinations of a string without changing positions & using window size?
in thread How can one get all possible combinations of a string without changing positions & using window size?

Hi hdb

Thanks for your quick reply and the code. I am not sure whether it can be reformulated as 2^10 combinations of 1's and 2's. But your code has partly solved my problem because it has produced some combinations without changing positions of letters in the string. I shall try to understand your code. If I find any difficulty, I shall get back to you.

With regards,

Comment on Re^2: How can one get all possible combinations of a string without changing positions & using window size?

In Section Seekers of Perl Wisdom