Create merge_tools.py

[madhuri7112]

No description provided.

[madhuri7112]

You are iterating through the entire string until ith character for every character so the time complexity of this loop is O(n^2) which is not ideal.

Instead, you can use a set to do this

def remove_dups(string):
   seen_characters = {}
   result = ""
   for i in range(len(string)):
      if  string[i] not in seen_characters:
           result = result + string[i]
      seen_characters.add(string[i])

The time complexity of this loop is only O(n) because it iterates through the string only once and look up in set is O(1) time operation.