Python | Permutation of a given string using inbuilt function

A permutation, also called an “arrangement number” or “order”, is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. A string of length n has n! permutation.

Examples:

Input :  str = 'ABC'
Output : ABC 
         ACB 
         BAC 
         BCA 
         CAB 
         CBA
Recommended: Please try your approach on {IDE} first, before moving on to the solution.
We have existing solution for this problem please refer Permutations of a given string using STL link. We can also solve this problem in python using inbuilt function permutations(iterable).


                

                    

                        

                            

                                

                                    filter_none
                                    

                                    edit
                                    close
                                    

                                    play_arrow
                                    

                                    link
                                    brightness_4
                                    code
                                
                            
                        
                    
                    
# Function to find permutations of a given string 
from itertools import permutations 
  
def allPermutations(str): 
       
     # Get all permutations of string 'ABC' 
     permList = permutations(str) 
  
     # print all permutations 
     for perm in list(permList): 
         print (''.join(perm)) 
        
# Driver program 
if __name__ == "__main__": 
    str = 'ABC'
    allPermutations(str) 
                    
    
                    

                
                

                    

                        chevron_right
                        



                        filter_none





Output:

ABC
ACB
BAC
BCA
CAB
CBA


Permutation and Combination in Python
Permutations of a given string with repeating characters

The idea is to use dictionary to avoid printing duplicates.





                                    filter_none


                                    edit

                                    close

                                    play_arrow

                                    link

                                    brightness_4

                                    code
                                










from itertools import permutations 
import string 
  
s = "GEEK"
a = string.ascii_letters 
p = permutations(s) 
  
# Create a dictionary 
d = [] 
for i in list(p): 
  
    # Print only if not in dictionary 
    if (i not in d): 
        d.append(i) 
        print(''.join(i)) 










                        chevron_right




                        filter_none





Output:

GEEK
GEKE
GKEE
EGEK
EGKE
EEGK
EEKG
EKGE
EKEG
KGEE
KEGE
KEEG






    

        My Personal Notes
        arrow_drop_up
    
    

        
        

            
            Save
        
    
Recommended Posts:
Histogram Plotting and stretching in Python (without using inbuilt function)
Python | Ways to find all permutation of a string
Inbuilt Data Structures in Python
Python program to count upper and lower case characters without using inbuilt functions
Permutation and Combination in Python
SymPy | Permutation.max() in Python
SymPy | Permutation.min() in Python
Generate all permutation of a set in Python
SymPy | Permutation.order() in Python
SymPy | Permutation.parity() in Python
SymPy | Permutation.random() in Python
SymPy | Permutation.rank_trotterjohnson() in Python
SymPy | Permutation.support() in Python
SymPy | Permutation.rank_nonlex() in Python
SymPy | Permutation.rank() in Python
SymPy | Permutation.next_trotterjohnson() in Python
SymPy | Permutation.rmul() in Python
SymPy | Permutation.transpositions() in Python
SymPy | Permutation.rmul_with_af() in Python
SymPy | Permutation.runs() in Python
Shashank Mishra
Check out this Author's contributed articles.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on  the "Improve Article" button below.


Improved By :  Divyu_Pandey