Given two words and a letter, return a single word that's a combination of both words, merged at the point where the given letter first appears in each word. The returned word should have the beginning of the first word and the ending of the second, with the dividing letter in the middle. You can assume both words will contain the dividing letter.

## Examples

```python
string_merge("hello", "world", "l")      ==>  "held"
string_merge("coding", "anywhere", "n")  ==>  "codinywhere"
string_merge("jason", "samson", "s")     ==>  "jasamson"
string_merge("wonderful", "people", "e") ==>  "wondeople"
```

Source: codewars | Difficulty: EASY
Tags: String algorithms

Fundamentals

Starter code: def string_merge(string1, string2, letter):
	

Solutions:
def string_merge(string1, string2, letter):
	return string1[:string1.index(letter)] + string2[string2.index(letter):]


def string_merge(string1, string2, letter):
	return string1[0:string1.find(letter)] + string2[string2.find(letter):]


def string_merge(s1: str, s2: str, letter: str) -> str:
	return f'{s1.partition(letter)[0]}{letter}{s2.partition(letter)[2]}'


string_merge = lambda a, b, l: a[:a.find(l)] + b[b.find(l):]


def string_merge(str1, str2, l):
	i = str1.find(l)
	j = str2.find(l)
	return str1[:i] + str2[j:]


def string_merge(string1, string2, letter):
	return f'{string1.partition(letter)[0]}{letter}{string2.partition(letter)[-1]}'


def string_merge(str1, str2, letter):
	return str1[:str1.index(letter)] + str2[str2.index(letter):]