Merge The Tools Hackerrank Solution

 Consider the following:

  • A string, , of length  where .
  • An integer, , where  is a factor of .

We can split  into  substrings where each subtring, , consists of a contiguous block of  characters in . Then, use each  to create string  such that:

  • The characters in  are a subsequence of the characters in .
  • Any repeat occurrence of a character is removed from the string such that each character in  occurs exactly once. In other words, if the character at some index  in  occurs at a previous index  in , then do not include the character in string .

Given  and , print  lines where each line  denotes string .

Example

There are three substrings of length  to consider: 'AAA', 'BCA' and 'DDE'. The first substring is all 'A' characters, so . The second substring has all distinct characters, so . The third substring has  different characters, so . Note that a subsequence maintains the original order of characters encountered. The order of characters in each subsequence shown is important.

Function Description

Complete the merge_the_tools function in the editor below.

merge_the_tools has the following parameters:

  • string s: the string to analyze
  • int k: the size of substrings to analyze

Prints

Print each subsequence on a new line. There will be  of them. No return value is expected.

Input Format

The first line contains a single string, .
The second line contains an integer, , the length of each substring.

Constraints

  • , where  is the length of 
  • It is guaranteed that  is a multiple of .

Sample Input

STDIN       Function
-----       --------
AABCAAADA   s = 'AABCAAADA'
3           k = 3

Sample Output

AB
CA
AD

Explanation

Split  into  equal parts of length . Convert each  to  by removing any subsequent occurrences of non-distinct characters in :

Print each  on a new line.



## Solution:---

def merge_the_tools(string, k):
    # your code goes here
    
    for i in range(0,len(string),k):
        
    
        a=string[i:i+k]
    
        b=set()
        for x in a:
            if x not in b:
                 
                print(x,end='') 
                b.add(x) 
        print()
                
         
                 
         
            
    
    
    
    
if __name__ == '__main__':

Comments

Post a Comment

Popular posts from this blog

The Minion Game Hackerrank Solution

Image
  Kevin and Stuart want to play the ' The Minion Game '. Game Rules Both players are given the same string,  . Both players have to make substrings using the letters of the string  . Stuart has to make words starting with  consonants . Kevin has to make words starting with  vowels . The game ends when both players have made all possible substrings. Scoring A player gets  +1  point for each occurrence of the substring in the string  . For Example : String   =  BANANA Kevin's vowel beginning word =  ANA Here,  ANA  occurs twice in  BANANA . Hence, Kevin will get  2  Points. For better understanding, see the image below: Your task is to determine the winner of the game and their score. Function Description Complete the  minion_game  in the editor below. minion_game  has the following parameters: string string:  the string to analyze Prints string:  the winner's name and score, sepa...
Read more

Arrays - DS | HackerRank Solutions

  An   array   is a type of data structure that stores elements of the same type in a contiguous block of memory. In an array,   , of size   , each memory location has some unique index,     (where   ), that can be referenced as     or   . Reverse an array of integers. Note:  If you've already solved our C++ domain's  Arrays Introduction  challenge, you may want to skip this. Example Return  . Function Description Complete the function  reverseArray  in the editor below. reverseArray  has the following parameter(s): int A[n] : the array to reverse Returns int[n] : the reversed array Input Format The first line contains an integer,  , the number of integers in  . The second line contains   space-separated integers that make up  . Constraints Sample Input 1 Copy Download Array: arr 1 4 3 2 4 1 4 3 2 Sample Output 1 2 3 4 1 ## Solutions:1-- import  math impor...
Read more

Word Order | HackerRank Solution

  You are given     words. Some words may repeat. For each word, output its number of occurrences. The output order should correspond with the input order of appearance of the word. See the sample input/output for clarification. Note:  Each input line ends with a  "\n"  character. Constraints: The sum of the lengths of all the words do not exceed  All the words are composed of lowercase English letters only. Input Format The first line contains the integer,  . The next   lines each contain a word. Output Format Output   lines. On the first line, output the number of distinct words from the input. On the second line, output the number of occurrences for each distinct word according to their appearance in the input. Sample Input 4 bcdef abcdefg bcde bcdef Sample Output 3 2 1 1 Explanation There are   distinct words. Here,  "bcdef"  appears twice in the input at the first and last positions. The other words app...
Read more