You're a programmer in a SEO company. The SEO specialist of your company gets the list of all project keywords everyday, then he looks for the longest keys to analyze them.

You will get the list with keywords and must write a simple function that returns the biggest search keywords and sorts them in lexicographical order.

For instance you might get:
```python
'key1', 'key2', 'key3', 'key n', 'bigkey2', 'bigkey1'
```

And your function should return:
```python
"'bigkey1', 'bigkey2'"
```

Don't forget to rate this kata! Thanks :)

Source: codewars | Difficulty: EASY
Tags: Fundamentals

Data structures

Starter code: def the_biggest_search_keys(*keys):
	

Solutions:
def the_biggest_search_keys(*keys):
	L = sorted(keys, key=lambda key: (-len(key), key))
	i = next((i for (i, key) in enumerate(L) if len(key) != len(L[0])), None)
	return str(L[:i])[1:-1] or "''"


def the_biggest_search_keys(*arg):
	mx = len(max(arg, key=len, default=''))
	return ', '.join(sorted((f"'{e}'" for e in list(arg) + [''] if len(e) == mx)))


def the_biggest_search_keys(*keys):
	if not keys:
		return "''"
	n = max(map(len, keys))
	keys = sorted([key for key in keys if len(key) == n])
	return ', '.join((f"'{key}'" for key in keys))


def the_biggest_search_keys(*keys):
	m = max(map(len, keys)) if keys else None
	return str(sorted(filter(lambda x: len(x) == m, keys)))[1:-1] if keys else "''"


def the_biggest_search_keys(*keys):
	if not keys:
		keys = ['']
	longest_key_length = max(map(len, keys))
	return ', '.join(sorted(("'%s'" % key for key in keys if len(key) == longest_key_length)))


def the_biggest_search_keys(*args):
	by_len = {}
	fmt = "'{}'".format
	for a in args:
		by_len.setdefault(len(a), []).append(a)
	try:
		return ', '.join((fmt(b) for b in sorted(by_len[max(by_len)])))
	except ValueError:
		return "''"


def the_biggest_search_keys(*keys):
	(biggest, max_len) = ([], 0)
	for key in keys:
		key_len = len(key)
		if key_len == max_len:
			biggest.append(key)
		elif key_len > max_len:
			(biggest, max_len) = ([key], key_len)
	return ', '.join(("'{}'".format(key) for key in sorted(biggest))) or "''"


def the_biggest_search_keys(*keys):
	if not keys:
		return "''"
	max_len = 0
	for key in keys:
		key_len = len(key)
		if key_len > max_len:
			max_len = key_len
			result = [key]
		elif key_len == max_len:
			result += [key]
	return str(sorted(result))[1:-1]


def the_biggest_search_keys(*args):
	maxLen = max(map(len, args), default=None)
	return "''" if not args else ', '.join(sorted(filter(lambda s: len(s) - 2 == maxLen, map(lambda s: "'{}'".format(s), args))))


def the_biggest_search_keys(*keywords):
	return ', '.join(sorted((f"'{x}'" for x in keywords if len(x) == max(map(len, keywords))))) if keywords else "''"