Python | Ways to find all permutation of a string
Given a string, write a Python program to find out all possible permutations of a string. Let’s discuss a few methods to solve the problem.
Method #1: Using Naive Method
Python3
# Python code to demonstrate# to find all permutation of# a given string# Initialising stringini_str = "abc"# Printing initial stringprint("Initial string", ini_str)# Finding all permutationresult = []def permute(data, i, length): if i == length: result.append(''.join(data) ) else: for j in range(i, length): # swap data[i], data[j] = data[j], data[i] permute(data, i + 1, length) data[i], data[j] = data[j], data[i] permute(list(ini_str), 0, len(ini_str))# Printing resultprint("Resultant permutations", str(result)) |
Output:
Initial string abc Resultant permutations ['abc', 'acb', 'bac', 'bca', 'cba', 'cab']
Method #2: Using itertools
Python3
# Python code to demonstrate# to find all permutation of# a given stringfrom itertools import permutations# Initialising stringini_str = "abc"# Printing initial stringprint("Initial string", ini_str)# Finding all permuatationpermutation = [''.join(p) for p in permutations(ini_str)]# Printing resultprint("Resultant List", str(permutation)) |
Output:
Initial string abc Resultant List ['abc', 'acb', 'bac', 'bca', 'cab', 'cba']
Attention geek! Strengthen your foundations with the Python Programming Foundation Course and learn the basics.
To begin with, your interview preparations Enhance your Data Structures concepts with the Python DS Course. And to begin with your Machine Learning Journey, join the Machine Learning – Basic Level Course
