# find position of keywords array (order of words in array doesn't matter) in search list array

def find_adjacent(lst, target):
	# assuming sequence of adjacent keywords has length > 1

	# create set for check process
	s = {key for key in target}
	# print s

	# check process: find two elements in sequence
	indices = []
	i = 0
	while i < len(lst):
		if lst[i] in s:
			j = i # j "records" position
			while j < len(lst) and lst[j] in s:
				j += 1
			if j - i > 1:
				indices.append(i + 1) # +1 because we are looking for the first index
			i = j
		else:
			i += 1
	print indices

@@ -314,16 +314,25 @@
 ces = %5B%5D
+ # output
 %0A%09i = 0%0A
@@ -585,8 +585,461 @@
 indices%0A
+%0A%0A# TEST CASES%0Alst_one = %5B%22hello%22, %22hi%22, %22welcome%22, %22greetings%22, %22hi%22, %22greetings%22, %22hey%22, %22hello%22%5D%0Atarget_one = %5B%22hi%22, %22hey%22, %22greetings%22%5D%0Afind_adjacent(lst_one, target_one) # prints %5B4%5D%0A%0Alst_two = %5B%22I%22, %22saw%22, %22susie%22, %22sitting%22, %22in%22, %22a%22, %22shoe%22, %22shine%22, %22shop%22,%0A    %22where%22, %22she%22, %22sits%22, %22she%22, %22shines%22, %22and%22, %22where%22, %22she%22, %22shines%22, %22she%22, %22sits%22%5D%0Atarget_two = %5B%22she%22, %22sits%22, %22shines%22%5D%0Afind_adjacent(lst_two, target_two) # prints %5B11, 17%5D%0A

Add test cases