- 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.
Example:
- s = 'AAABCADDE'
- k = 3
- There are three substrings of length 3 to consider: 'AAA', 'BCA' and 'DDE'. The first substring is all 'A' characters, so u1='A'. The second substring has all distinct characters, so u2 = 'BCA'. The third substring has 2 different characters, so u3='DE'.
- Note that a subsequence maintains the original order of characters encountered. The order of characters in each subsequence shown is important.
- 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 n/k of them. No return value is expected.
- The first line contains a single string, s.
- The second line contains an integer, k, the length of each substring.
- 1 <= n <= 104, where n is the length of s
- 1 <= k <= n
- It is guaranteed that n is a multiple of k.
STDIN Function
----- --------
AABCAAADA s = 'AABCAAADA'
3 k = 3
Sample Output:AB
CA
AD
Explanation:- Split s into n/k = 9/3 = 3 equal parts of length k = 3. Convert each ti to ui by removing any subsequent occurrences of non-distinct characters in ti:
- t0 = "AAB" ➡ u0 = "AB"
- t1 = "CAA" ➡ u1 = "CA"
- t2 = "ADA" ➡ u2 = "AD"
- Print each ui on a new line.
def merge_the_tools(string, k):
for i in range(0,len(string),k):
uniq_str = ''
for j in string[i:i+k]:
if j not in uniq_str:
uniq_str += j
print(uniq_str)
if __name__ == '__main__':
string, k = input(), int(input())
merge_the_tools(string, k)
Disclaimer: The problem statement is given by hackerrank.com but the solution is generated by the Geek4Tutorial admin. If there is any concern regarding this post or website, please contact us using the contact form. Thank you!
No comments:
Post a Comment