# itertools.permutations() in Python HackerRank Solution

#### ByBrokenprogrammers

Dec 9, 2022

Hello Programmers, In this post, you will know how to solve the itertools.permutations() in Python HackerRank Solution. This problem is a part of the HackerRank Python Programming Series.

One more thing to add, donâ€™t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.

## itertools.permutations() in Python HackerRank Solution

### Problem

itertools.permutations(iterable[, r])
This tool returns successive r length permutations of elements in an 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 printed in a lexicographic sorted order. So, if the input iterable is sorted, the permutation tuples will be produced in a sorted order.
Sample Code :

```>>> from itertools import permutations
>>> print permutations(['1','2','3'])
<itertools.permutations object at 0x02A45210>
>>>
>>> print list(permutations(['1','2','3']))
[('1', '2', '3'), ('1', '3', '2'), ('2', '1', '3'), ('2', '3', '1'), ('3', '1', '2'), ('3', '2', '1')]
>>>
>>> print list(permutations(['1','2','3'],2))
[('1', '2'), ('1', '3'), ('2', '1'), ('2', '3'), ('3', '1'), ('3', '2')]
>>>
>>> print list(permutations('abc',3))
[('a', 'b', 'c'), ('a', 'c', 'b'), ('b', 'a', 'c'), ('b', 'c', 'a'), ('c', 'a', 'b'), ('c', 'b', 'a')]
```

#### Task :

You are given a string S.
Your task is to print all possible permutations of size k of the string in lexicographic sorted order.

#### Input Format :

A single line containing the space separated string S and the integer value k.

#### Constraints :

• 0 < k <= len(S)

#### Output Format :

Print the permutations of the string S on separate lines.

#### Sample Input :

```HACK 2
```

```AC
AH
AK
CA
CH
CK
HA
HC
HK
KA
KC
KH```

### itertools.permutations() in Python HackerRank Solutions

```# itertools.permutations() in Python - Hacker Rank Solution
# Python 3
# itertools.permutations() in Python - Hacker Rank Solution START
from itertools import permutations
s,k = input().split()
words = list(permutations(s,int(k)))
words = sorted(words, reverse=False)
for word in words:
print(*word,sep='')
# itertools.permutations() in Python - Hacker Rank Solution END```

Disclaimer: The above Problem (itertools.permutations() in Python) is generated by Hackerrank but the Solution is Provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.