## Question

Asked By – Nihar Sarangi

I have a string. I want to generate all permutations from that string, by changing the order of characters in it. For example, say:

```
x='stack'
```

what I want is a list like this,

```
l=['stack','satck','sackt'.......]
```

Currently I am iterating on the list cast of the string, picking 2 letters randomly and transposing them to form a new string, and adding it to set cast of l. Based on the length of the string, I am calculating the number of permutations possible and continuing iterations till set size reaches the limit.

There must be a better way to do this.

**Now we will see solution for issue: Finding all possible permutations of a given string in python **

## Answer

The itertools module has a useful method called permutations(). The documentation says:

itertools.permutations(iterable[, r])Return successive r length permutations of elements in the iterable.

If r is not specified or is None, then r defaults to the length of the

iterable and all possible full-length permutations are generated.Permutations are emitted in lexicographic sort order. So, if the input

iterable is sorted, the permutation tuples will be produced in sorted

order.

You’ll have to join your permuted letters as strings though.

```
>>> from itertools import permutations
>>> perms = [''.join(p) for p in permutations('stack')]
>>> perms
```

[‘stack’, ‘stakc’, ‘stcak’, ‘stcka’, ‘stkac’, ‘stkca’, ‘satck’,

‘satkc’, ‘sactk’, ‘sackt’, ‘saktc’, ‘sakct’, ‘sctak’, ‘sctka’,

‘scatk’, ‘scakt’, ‘sckta’, ‘sckat’, ‘sktac’, ‘sktca’, ‘skatc’,

‘skact’, ‘skcta’, ‘skcat’, ‘tsack’, ‘tsakc’, ‘tscak’, ‘tscka’,

‘tskac’, ‘tskca’, ‘tasck’, ‘taskc’, ‘tacsk’, ‘tacks’, ‘taksc’,

‘takcs’, ‘tcsak’, ‘tcska’, ‘tcask’, ‘tcaks’, ‘tcksa’, ‘tckas’,

‘tksac’, ‘tksca’, ‘tkasc’, ‘tkacs’, ‘tkcsa’, ‘tkcas’, ‘astck’,

‘astkc’, ‘asctk’, ‘asckt’, ‘asktc’, ‘askct’, ‘atsck’, ‘atskc’,

‘atcsk’, ‘atcks’, ‘atksc’, ‘atkcs’, ‘acstk’, ‘acskt’, ‘actsk’,

‘actks’, ‘ackst’, ‘ackts’, ‘akstc’, ‘aksct’, ‘aktsc’, ‘aktcs’,

‘akcst’, ‘akcts’, ‘cstak’, ‘cstka’, ‘csatk’, ‘csakt’, ‘cskta’,

‘cskat’, ‘ctsak’, ‘ctska’, ‘ctask’, ‘ctaks’, ‘ctksa’, ‘ctkas’,

‘castk’, ‘caskt’, ‘catsk’, ‘catks’, ‘cakst’, ‘cakts’, ‘cksta’,

‘cksat’, ‘cktsa’, ‘cktas’, ‘ckast’, ‘ckats’, ‘kstac’, ‘kstca’,

‘ksatc’, ‘ksact’, ‘kscta’, ‘kscat’, ‘ktsac’, ‘ktsca’, ‘ktasc’,

‘ktacs’, ‘ktcsa’, ‘ktcas’, ‘kastc’, ‘kasct’, ‘katsc’, ‘katcs’,

‘kacst’, ‘kacts’, ‘kcsta’, ‘kcsat’, ‘kctsa’, ‘kctas’, ‘kcast’,

‘kcats’]

If you find yourself troubled by duplicates, try fitting your data into a structure with no duplicates like a `set`

:

```
>>> perms = [''.join(p) for p in permutations('stacks')]
>>> len(perms)
720
>>> len(set(perms))
360
```

Thanks to @pst for pointing out that this is not what we’d traditionally think of as a type cast, but more of a call to the `set()`

constructor.

This question is answered By – machine yearning

**This answer is collected from stackoverflow and reviewed by FixPython community admins, is licensed under cc by-sa 2.5 , cc by-sa 3.0 and cc by-sa 4.0 **