We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Itertools
  4. itertools.combinations()
  5. Discussions

itertools.combinations()

  • jkarakus
     + 0 comments

    Solution without nested for loops (better time complexity)

    from itertools import combinations, chain
S = input().split()
n = int(S[1])

combs = chain.from_iterable(combinations(sorted(S[0]), i) for i in range(1, n + 1))
for comb in combs:
    print(''.join(comb))