code: def insort_no_dup(lst, item):
      
      import bisect
      ix = bisect.bisect_left(lst, item)
      if lst[ix] != item: 
          lst[ix:ix] = [item]
docs: If item is not in lst, add item to list at its sorted position