Skip to content
Programmingoneonone
Programmingoneonone
  • Home
  • CS Subjects
    • Internet of Things (IoT)
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programmingoneonone

HackerRank itertools.combinations() solution in python

YASH PAL, 31 July 2024

In this itertools.combinations() problem solution in python This tool returns the r 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.

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

HackerRank itertools.combinations() solution in python

Problem solution in Python 2 programming.

from itertools import combinations

S,k = raw_input().split()
k = int(k)

for r in xrange(1,k+1):
    print 'n'.join(sorted(''.join(sorted(c)) for c in combinations(S,r)))
        

Problem solution in Python 3 programming.

# Enter your code here. Read input from STDIN. Print output to STDOUT
from itertools import combinations

s , n  = input().split()

for i in range(1, int(n)+1):
    for j in combinations(sorted(s), i):
        print(''.join(j))

Problem solution in pypy programming.

# Enter your code here. Read input from STDIN. Print output to STDOUT
from itertools import combinations
string_number = raw_input().split()
string = string_number[0]
number = map(int, string_number[1])

def Print(given_list):
    for elem in given_list:
        n = len(elem)
        elem_print = ""
        for i in range(0, n):     
            elem_print+=elem[i]
        print elem_print
    return

for i in range(1, number[0]+1):
    Print(list(combinations(sorted(string), i)))
# print list(combinations(string, number[0]))

Problem solution in pypy3 programming.

# Enter your code here. Read input from STDIN. Print output to STDOUT

import itertools

ll, m = input().split()

k = int(m)


for n in range(k):
    for i in itertools.combinations(sorted(ll), n+1):
        print("".join(i))
        

coding problems solutions Hackerrank Problems Solutions Python Solutions

Post navigation

Previous post
Next post

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes