Merge the Tools! - Hacker Rank Solution

Consider the following:

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

We can split  into  subsegments where each subsegment, , 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 .

Input Format

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

Constraints

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

Output Format

Print  lines where each line  contains string .

Sample Input

AABCAAADA
3   

Sample Output

AB
CA
AD

Explanation

String  is split into  equal parts of length . We convert each  to  by removing any subsequent occurrences non-distinct characters in :

We then print each  on a new line.

Merge the Tools! - Hacker Rank Solution

The basic algorithm for solving this challenge is as follows:

1. Divide string  into  subsegments of length .
2. Save the subsegment as variable . For each :
1. Create a variable, , and initialize it to the empty string.
2. Iterate over the characters in  and append each character to  that does not already exist in .
3. After iterating through all the characters in , print the value of .

Merge the Tools! - Hacker Rank Solution

Python 2

s = raw_input()
k = input()
chunks = len(s)/k

for index in xrange(chunks):
    merge = ""
    T = s[index*k : (index+1)*k]
    for ch in T:
        if ch not in merge:
            merge += ch
    print merge

Python 3

s = input()
k = int(input())
num_subsegments = int(len(s) / k)

for index in range(num_subsegments):
    # Subsegment string
    t = s[index * k : (index + 1) * k]
    
    # Subsequence string having distinct characters
    u = ""
    
    # If a character is not already in 'u', append
    for c in t:
        if c not in u:
            u += c

    # Print final converted string
    print(u)