Merge the Tools!

Sort by

recency

|

2662 Discussions

|

  • + 0 comments

    This is the best and simplest solution:

    def merge_the_tools(string, k): for i in range(len(string)): if i % k == 0: stry="" for j in range(k): if string[j+i] not in stry: stry = stry + string[j+i] print(stry)

    if name == 'main': string, k = input(), int(input()) merge_the_tools(string, k)

  • + 0 comments
    def merge_the_tools(string, k):
        # your code goes here
        for i in range(0, len(string), k):
            substring = string[i: i + k]
            seen = set()
            result = ""
            for ch in substring:
                if ch  not in seen:
                    seen.add(ch)
                    result += ch
            print(result)
    
  • + 0 comments
    def merge_the_tools(s: str, k: int):
        # iterate over substrings
        for i in range(0, len(s), k):
            # temp string
            result = ""
            # iterate over chars in substring
            for j in s[i:i + k]:
                if not j in result:
                    # add char if not present
                    result = result + j
            print(result)
    
  • + 0 comments
    def merge_the_tools(string: str, k: int):
        length: int = len(string)
    
        for i in range(0, length, k):
            result: list[str] = []
            for char in string[i : i + k]:
                if char not in result:
                    result.append(char)
    
                print("".join(result))
    
    
    if __name__ == "__main__":
        string, k = input(), int(input())
        merge_the_tools(string, k)
    
  • + 0 comments

    My code:

    def merge_the_tools(string, k): subs = [] word = ''

    for i in range(1,len(string) + 1):
        if string[i-1] not in word:
            word += string[i-1]
        if i % k == 0:
            subs.append(word)
            word = ''
    
    for j in range(0, len(subs)):
        print(subs[j])