Merge the Tools in python - HackerRank Solution
Problem :
Consider the following:
- A string, s, of length n where s = c0c1.....cn-1.
- An integer, k, where k is a factor of n.
- The characters in ui are a subsequence of the characters in ti.
- Any repeat occurrence of a character is removed from the string such that each character in ui occurs exactly once. In other words, if the character at some index j in ti occurs at a previous index<j in ti, then do not include the character in string ui.
Given s and k, print n/k lines where each line i denotes string ui.
Input Format :
The second line contains an integer, k, denoting the length of each
subsegment.
Constraints :
- 1 <= n <= 10^4, where n is the length of s.
- 1 <= k <= n
- it is guaranteed that n is a multiple of k.
Output Format :
Print n/k lines where each line i contains string ui.
Sample Input :
AABCAAADA
3
Sample Output :
AB CA AD
Explanation :
- t0 = "AAB" -> u0 = "AB"
- t1 = "CAA" -> u1 = "CA"
- t2 = "ADA" -> u2 = "AD"
We then print each ui on a new line.
Solution :
1 2 3 4 5 6 7 8 9 10 11 12 13 14 | # Merge the Tools in python - Hacker Rank Solution # Python 3 # Merge the Tools in python - Hacker Rank Solution START from collections import OrderedDict def merge_the_tools(string, k): # your code goes here strlen = len(string) for i in range(0,strlen,k): print(''.join(OrderedDict.fromkeys(string[i:i + k]))) # Merge the Tools in python - Hacker Rank Solution END if __name__ == '__main__': string, k = input(), int(input()) merge_the_tools(string, k) |
the above hole problem statement is given by hackerrank.com but the solution is generated by the codeworld19 authority if any of the query regarding this post or website fill the following contact form thank you.
CodeWorld19
Hey, I am Parthe Omkar
Interesting Blog!!
Python Online Training In Hyderabad
Python Online Training