Python-сообщество

['noise', 'qw', 'job']

['qw']

def regular_words_counter(lst):
	count = 0
	new_lst = lst
	res_lst = lst
	print(res_lst)
	for i in lst:
		new_lst.remove(i)
		for j in new_lst:
			if {x for x in i}.isdisjoint({x for x in j}):
				res_lst.remove(i)
	return res_lst

 res_lst.remove(i) 

res_lst.remove(res_lst[lst.index(i)])

 def regular_words_counter(lst):
	count = 0
	new_lst = lst
	res_lst = []
	for i in lst:
		new_lst.remove(i)
		for j in new_lst:
			if {x for x in i}.isdisjoint({x for x in j}):
				res_lst.append(i)
	return res_lst

 ['noise', 'job'] 

def foo(lst):
	new_lst = lst
	res = []
	for i in lst:
		index = new_lst.index(i)
		new_lst.remove(i)
		flag = True
		for j in new_lst:
			if not {x for x in i}.isdisjoint({x for x in j}):
				flag = False
		if flag:
			res.append(i)
		new_lst.insert(index, i)
	return res

def find_true_strings(lst):
    lst_set = list(map(set, lst))
    mem = []
    for num1, elem1 in enumerate(lst_set):
        if num1 in mem:
            continue
        bad_str = False
        for num2, elem2 in enumerate(lst_set[num1+1:], num1+1):
            if elem1 & elem2:
                mem.append(num2)
                bad_str = True
        if not bad_str:
            yield lst[num1]

from functools import reduce
 
def rotations(lst):
    x, *xs = lst
    for _ in range(len(lst)):
        yield x, xs
        x, *xs = xs + [x]
 
def regs(lst):
    return [elt for elt, rest in rotations(lst)
            if not set(elt) & reduce(set.union, rest, set())]