How could you generate all permutations of ABC with no repeats for any length?

Asked Oct 27 '21 at 19:02

Active Oct 27 '21 at 19:02

Viewed 64 times

So if I had a list of

String[] list = {A,B,C}; generateAllCombonations(list);

would return: ABC ACB BAC BCA CAB CBA

for any length of the list? AAB would not be allowed given no repeats also, AB would be invalid because it is not the length of the original array

asked Oct 27 '21 at 19:02

AceNutella

1

https://stackoverflow.com/questions/4240080/generating-all-permutations-of-a-given-string – GriffeyDog Oct 27 '21 at 19:15
Please provide enough code so others can better understand or reproduce the problem. – Aidan Donnelly Oct 28 '21 at 07:30

0 Answers0