HackerRank itertools.combinations() solution in python |python question solution
Table of Contents
itertools.combinations(iterable, r)
This tool returns the length subsequences of elements from the input iterable.
Combinations are emitted in lexicographic 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)]
Task
You are given a string .
Your task is to print all possible combinations, up to size , of the string in lexicographic sorted order.
Input Format
A single line containing the string and integer value separated by a space.
Constraints
The string contains only UPPERCASE characters.
Output Format
Print the different combinations of string on separate lines.
Sample Input
HACK 2
Sample Output
A
C
H
K
AC
AH
AK
CH
CK
HK
In this itertools.combinations() problem we need to develop a python program that can read an input line with a list and integer separated with space. and then we need to use the itertools module and combinations() function to print the iterable values on the output screen.
Problem solution in Python 2 programming.
Problem solution in Python 3 programming.
Problem solution in pypy programming.
Problem solution in pypy3 programming.