There's a new security company in Paris, and they decided to give their employees an algorithm to make first name recognition faster. In the blink of an eye, they can now detect if a string is a first name, no matter if it is a one-word name or an hyphenated name. They're given this documentation with the algorithm: 

*In France, you'll often find people with hyphenated first names. They're called "prénoms composés".
There could be two, or even more words linked to form a new name, quite like jQuery function chaining ;). 
They're linked using the - symbol, like Marie-Joelle, Jean-Michel, Jean-Mouloud. 
Thanks to this algorithm, you can now recognize hyphenated names quicker than Flash !* 
(yeah, their employees know how to use jQuery. Don't ask me why)


Your mission if you accept it, recreate the algorithm.
Using the function **showMe**, which takes a **yourID** argument, you will check if the given argument is a name or not, by returning true or false. 

*Note that*

- String will either be a one-word first name, or an hyphenated first name , its words being linked by "-". 
- Words can only start with an uppercase letter, and then lowercase letters (from a to z)


Now is your time to help the guards !

Source: codewars | Difficulty: EASY
Tags: Fundamentals

Starter code: def show_me(name):
	

Solutions:
import re

def show_me(name):
	return bool(re.match('(-[A-Z][a-z]+)+$', '-' + name))


def show_me(name):
	return all((word.isalpha() and word.capitalize() == word for word in name.split('-')))


from re import match, compile

def show_me(name):
	return match(compile('^[A-Z][a-z]+(?:-[A-Z][a-z]+)*$'), name) != None


import re

def show_me(s):
	return bool(re.match('[A-Z][a-z]*(-[A-Z][a-z]*)*$', s))


def show_me(name):
	return '--' not in name and name[0] != '-' and (name[-1] != '-') and (name.title() == name) and all([c.isalpha() or c == '-' for c in name])


import re

def show_me(name):
	return re.fullmatch('[A-Z][a-z]+(-[A-Z][a-z]+)*', name) is not None