README.md

Merge the Tools!

https://www.hackerrank.com/challenges/merge-the-tools

Problem

Consider the following:

• A string, s, of length n where s=c₀c₁...c_n-1.
• An integer, k, where k is a factor of n.

We can split s into n/k subsegments where each subsegment, t_i, consists of a contiguous block of k characters in s. Then, use each t_i to create string u_i such that:

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

Given s and k, print n/k lines where each line i denotes string u_i.

Input Format

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

Output Format

Print n/k lines where each line i contains string u_i.

Sample Input 0

AABCAAADA
3   

Sample Output 0

AB
CA
AD

My Solution

• Python 2
• Python 3