Question

Write a recursive function to find all possible combination of given alphabets , say given alphabets (a,b,c ).Number of alphabets given is N= 3 , You have to print all possible words of length of N. No repetition of alphabets within the word
OUTPUT:
abc
bca
cab
Can anybody solve this using python??​

Answer 1

Explanation:

jagagayahahaysgs7shs7eheisbsisnaja9a