My solution but nicer. I take off my hat good sir

really like this solution.

best solution. mine is pretty much the same, but much uglier with a try else block ;-)

Nice kata. always nice to see a greedy algorithm

Really nice solution.

It's clear which pattern is used for which length of a word. also it's clear and flexible.

My respect, good sir :)

That was my first idea :), but i thought there must be an easier way

really nice kata. helps a lot if you want to see if you understand decorators in python.

that's what i like about codewars. it has some exercises that could be useful in a real application and not just acedemic purpose.

just as an information. python method should be with underscores. so isConsonant should be is_consonant.

if you keep on writing python and want to be pythonic look at PEP 8 (https://www.python.org/dev/peps/pep-0008/) :-)

not an iterator. if you leave the braces you have a generator expression ;-)

simple change, but bigger meaning: with the braces you create a list, save it into memory and sum that afterwards. without the braces the list will be generated and not stored in memory.

that won't be a problem with small lists, but with bigger ones a generator expression is more efficient

Doesn't work with 0

My respect for actually doing the hash yourself. If that was the task then this kyu would not be a 7. More like a 2 or 3. :-)

Nice kata. but the sample tests are not correct anymore. I think the codewars wikipedia site was updated and now the test does not work anymore.

The key 'Entrepreneurship': 'https://en.wikipedia.org/wiki/Entrepreneurship' must be replaced with 'Organizational founder': 'https://en.wikipedia.org/wiki/Organizational_founder'

Eveything else in the assert is correct

Nice little kata. that could also be used in a real world application. also really nice recursion exercise

i would replace your string in alphabet with

import string
string.ascii_letters

it's the same but you have a constant variable.

otherwise nice solution