human
What is a code to print all the non and the other steps required given the following:
Print all the non | Function to print all the non - repeating words from the two given sentences.
Concatenate the two strings into one.
Iterating over the whole concatenated string.
Searching for the word in A . If while searching , we reach the end of the string , then the word is not present in the string.
Initialise word for the next iteration.
Driver code"
Solution in Python:
assistant
#Here is code to print all the non and the other steps required.
 def removeRepeating ( s1 , s2 ) :
	s3 = s1 + " ▁ " + s2 + " ▁ "
	words = " "
	i = 0
	for x in s3 :
		if ( x == ' ▁ ' ) :
			if ( words not in s1 or words not in s2 ) :
				print ( words , end = " " )
			words = " ▁ "
		else :
			words = words + x
if __name__ == " _ _ main _ _ " :
	s1 = " I ▁ have ▁ go ▁ a ▁ pen "
	s2 = " I ▁ want ▁ to ▁ go ▁ park "
	removeRepeating ( s1 , s2 )