Answer to Question #209665 in Python for sudheer

Question

Given a sentence as input, find all the unique combinations of two words and print the word combinations that are not adjacent in the original sentence in lexicographical order.

For example, if the given sentence is "python is a programming language", the possible unique combination of two are (a, is), (a, language), (a, programming), (a, python), (is, language), (is, programming), (is, python), (language, programming), (language, python), (programming, python). Out of these the combinations, (a, is), (a, programming), (is, python), (language, programming) are not valid as they contain words that are adjacent in the given sentence. So the output should be

a language

a python

is language

is programming

language python

programming python

Answer 1

sentence = input("Input sentence: ")
sent_split = sentence.split()
sent_split.sort(reverse = True)
result = []
for word1 in sent_split:
    for word2 in sent_split:
        result.append(word1 + " " + word2)
       
result = set(result)
result = list(result)
result.sort()



for item in result:
    if item in sentence:
        result.remove(item)
        
for item in result: 
    if " ".join(item.split()[::-1]) in sentence:
        result.remove(item)
        
for item in result:
    item_spl = item.split()
    if (item_spl[0] == item_spl[1]) and (sentence.count(item_spl[0]) < 2):
        result.remove(item)
        
for item in result:
    item_spl = item.split()
    duplicates = item_spl[1] + " " + item_spl[0]
    if duplicates in result:
        result.remove(duplicates)
results=[]
for item in result:
    item=item.split()
    if item[1]<item[0]:
        temp=item[1]
        item[1]=item[0]
        item[0]=temp
    item = item[0]+" "+item[1]
    results.append(item)
results.sort()
for item in results:        
    print(item)