Sort array by last character

Complete the function to sort a given array or list by last character of elements.

```if-not:haskell
Element can be an integer or a string.
```

### Example:

```
['acvd', 'bcc']  -->  ['bcc', 'acvd']
```

The last characters of the strings are `d` and `c`. As `c` comes before `d`, sorting by last character will give `['bcc', 'acvd']`.

If two elements don't differ in the last character, then they should be sorted by the order they come in the array.

```if:haskell
Elements will not be empty (but the list may be).
```

Source: codewars | Difficulty: EASY

Starter code: def sort_me(arr):
	

Solutions:
def sort_me(arr):
	return sorted(arr, key=lambda elem: str(elem)[-1])


def sort_me(arr):
	return sorted(arr, key=lambda x: str(x)[-1])


def sort_me(xs):
	return sorted(xs, key=lambda x: str(x)[-1])


def sort_me(a):
	return sorted(a, key=lambda x: str(x)[-1])


def sort_me(arr):
	return sorted(arr, key=lambda e: str(e)[-1])


sort_me = lambda arr: sorted(arr, key=lambda x: str(x)[-1])


def sort_me(arr):
	print(len(arr))
	a = [str(x) for x in arr]
	print(a)
	b = [x[-1] for x in a]
	c = list(zip(arr, b))
	c = sorted(c, key=lambda x: x[1])
	print(c)
	d = [x[0] for x in c]
	return d


sort_me = lambda arr: sorted(arr, key=lambda item: str(item)[-1])


def sort_me(lst):
	lst.sort(key=lambda a: str(a)[-1])
	return lst


def sort_me(arr):
	return [i[1] for i in sorted([[str(i), i] for i in arr], key=lambda i: i[0][-1])]