# itertools.combinations() HackerRank solution in python

## itertools.combinations(iterable, r)

This tool returns the r length subsequences of elements from the input iterable.

Combinations are emitted in lexicographically sorted order. So, if the input iterable is sorted, the combination tuples will be produced in sorted order.

### Sample Code

```>>> from itertools import combinations
>>>
>>> print list(combinations('12345',2))
[('1', '2'), ('1', '3'), ('1', '4'), ('1', '5'), ('2', '3'), ('2', '4'), ('2', '5'), ('3', '4'), ('3', '5'), ('4', '5')]
>>>
>>> A = [1,1,3,3,3]
>>> print list(combinations(A,4))
[(1, 1, 3, 3), (1, 1, 3, 3), (1, 1, 3, 3), (1, 3, 3, 3), (1, 3, 3, 3)]
```

You are given a string S.

Your task is to print all possible combinations, up to size k, of the string in lexicographically sorted order.

### Input Format

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

### Constraints

The string contains only UPPERCASE characters.

### Output Format

Print the different combinations of string S on separate lines.

### Sample Input

```HACK 2
```

```A
C
H
K
AC
AH
AK
CH
CK
HK
```

### Program

 ``` 1 2 3 4 5 6 7 8 9 10``` ```# import combinations from itertools import combinations # take a input from the user s, k = map(str,input().split()) # print the combination for i in range(1, int(k)+1): for j in combinations(sorted(s), i): print(''.join(j)) ```

#### Disclaimer

The whole problem statement is given by HackerRank and the solution to this problem is solved by the docodehere, if you have any queries then please contact us.
No Comment