Posts

Showing posts from October, 2020

Challenge - #30 - itertools.combinations()

  # Enter your code here. Read input from STDIN. Print output to STDOUT from  itertools  import  combinations s , k =  input ().split() k =  int (k) for  i  in   range ( 1 , k+ 1 ):      for  j  in   list (combinations( sorted (s),i)):          print ( '' .join(j))

Challenge - #29 - itertools.permutations()

  # Enter your code here. Read input from STDIN. Print output to STDOUT from  itertools  import  permutations s , n  =  input ().split() for  i  in   list (permutations( sorted (s), int (n))):      print ( '' .join(i),end =  '\n' )

Challenge - #28 - itertools.product()

  # Enter your code here. Read input from STDIN. Print output to STDOUT from  itertools  import  product A =  list ( map ( int ,  input ().split())) B =  list ( map ( int ,  input ().split())) for  i  in   list (product(A,B)):      print (i, end =  ' ' )

Challenge - #27 - Merge The Tools!

  def  merge_the_tools(string, k):      # your code goes here      for  i  in   range ( 0 , len (string), k):         t = string[i:i+k]         u =  set ()          for  j  in  t:              if  j  not   in  u:                  print (j,end =  '' )                 u.add(j)          print () if  __name__ ==  '__main__' :     string, k =  input (),  int ( input ())     merge_the_tool...

Challenge - #26 - The Minion Game

  def  minion_game(string):      # your code goes here     vowel =  'AEIOU'     ks =  0   # ks - kevin score     ss =  0   # ss - stuart score      for  i  in   range ( len (s)):          if  s[i]  in  vowel :             ks += ( len (s)-i)          else :             ss +=  len (s)-i           if  ks > ss :          print (f "Kevin {ks}" )      elif  ks < ss :    ...

Challenge - #25 - Capitalize!

  #!/bin/python3 import  math import  os import  random import  re import  sys # Complete the solve function below. def  solve(s):      return   ' ' .join([i.capitalize()  for  i  in  s.split( ' ' )])           if  __name__ ==  '__main__' :     fptr =  open (os.environ[ 'OUTPUT_PATH' ],  'w' )     s =  input ()     result = solve(s)     fptr.write(result +  '\n' )     fptr.close()

Challenge - #24 - Alphabet Rangoli

import  string def  print_rangoli(size):      # your code goes here     characters = string.ascii_lowercase     lst = []     width  =  4  * size  -3      for  i  in   range (size):         s =  '-' .join(characters[i:size])         lst.append((s[:: -1 ] + s[ 1 :]).center(width, '-' ))      print ( '\n' .join(lst[: 0 : -1 ] + lst)) if  __name__ ==  '__main__' :     n =  int ( input ())     print_rangoli(n)

Challenge - #23 - String Foramtting

 def print_formatted(number):     w = len(str(bin(number))[2:])     for i in range(1,number +1):         print(str(i).rjust(w,' '),oct(i)[2:].rjust(w,' '),hex(i)[2:].upper().rjust(w,' '),bin(i)[2:].rjust(w,' ')) if __name__ == '__main__':     n = int(input())     print_formatted(n)

Challenge #22 - Designer Door Mat

 # Enter your code here. Read input from STDIN. Print output to STDOUT nm = input().split() N = int(nm[0]) M = int(nm[1]) c = '.|.' thickness = N //2 upper_pattern = [] for i in range(thickness):     string = (c*((2*i)+1)).center(M,'-')     upper_pattern.append(string) welcome_message = ['WELCOME'.center(M,'-')] lower_pattern = upper_pattern[::-1] print('\n'.join(upper_pattern + welcome_message + lower_pattern))